Back to VTRMC list
Problem source: HTML (archive) and PDF
(archive)
Problem 1#
Find the inflection point of the graph of F(x)=∫0x3et2dt, for x∈R.
Problem 2#
Assume that x1>y1>0 and y2>x2>0. Find a formula for the
shortest length l of a planar path that goes from (x1,y1) to (x2,y2) and that touches both the x-axis and the y-axis. Justify your answer.
Problem 3#
Let fn(x) be defined recursively by
f0(x)=x,f1(x)=f(x),fn+1(x)=f(fn(x)),for n≥0,
where f(x)=1+sin(x−1).
- Show that there is a unique point x0 such that f2(x0)=x0.
- Find n=0∑∞3nfn(x0) with the above x0.
Problem 4#
Let {tn}n=1∞ be a sequence of positive numbers such
that t1=1 and tn+12=1+tn, for n≥1. Show that tn is
increasing in n and find n→∞limtn.
Problem 5#
Let A=(01−23). Find A100. You have to find all four entries.
Problem 6#
Let p(x) be the polynomial p(x)=x3+ax2+bx+c. Show that if p(r)=0, then
x−rp(x)−2x+1−rp(x+1)+x+2−rp(x+2)=2
for all x except x=r, r−1 and r−2.
Problem 7#
Find n→∞limn2logn2log2+3log3+⋯+nlogn.
Problem 8#
Some goblins, N in number, are standing in a row while “trick-or-treat”-ing.
Each goblin is at all times either 2′ tall or 3′ tall, but can change
spontaneously from one of these two heights to the other at will. While lined
up in such a row, a goblin is called a Local Giant Goblin (LGG) if
he/she/it is not standing beside a taller goblin. Let G(N) be the total of
all occurrences of LGG’s as the row of N goblins transmogrifies through all
possible distinct configurations, where height is the only distinguishing
characteristic. As an example, with N=2, the distinct configurations are
2^2^, 23^, 3^2, 3^3^, where a cap
indicates an LGG. Thus G(2)=6.
- Find G(3) and G(4).
- Find, with proof, the general formula for G(N), N=1,2,3,….