Back to VTRMC list
Problem source: HTML (archive) and PDF (archive)

Problem 1

Find the inflection point of the graph of F(x)=0x3et2dtF(x) = \displaystyle{\int_{0}^{x^3} e^{t^2} dt}, for xRx \in \mathbb{R}.

Problem 2

Assume that x1>y1>0x_1 > y_1 > 0 and y2>x2>0y_2 > x_2 > 0. Find a formula for the shortest length ll of a planar path that goes from (x1,y1)(x_1, y_1) to (x2,y2)(x_2, y_2) and that touches both the xx-axis and the yy-axis. Justify your answer.

Problem 3

Let fn(x)f_n(x) be defined recursively by f0(x)=x,f1(x)=f(x),fn+1(x)=f(fn(x)),for n0, f_0(x) = x, \quad f_1(x) = f(x), \quad f_{n+1}(x) = f(f_n(x)), \quad \text{for } n \ge 0, where f(x)=1+sin(x1)f(x) = 1 + \sin(x - 1).

  1. Show that there is a unique point x0x_0 such that f2(x0)=x0f_2(x_0) = x_0.
  2. Find n=0fn(x0)3n\displaystyle{\sum_{n=0}^{\infty} \frac{f_n(x_0)}{3^n}} with the above x0x_0.

Problem 4

Let {tn}n=1\lbrace t_n \rbrace_{n=1}^{\infty} be a sequence of positive numbers such that t1=1t_1 = 1 and tn+12=1+tnt_{n+1}^2 = 1 + t_n, for n1n \ge 1. Show that tnt_n is increasing in nn and find limntn\displaystyle{\lim_{n \to \infty} t_n}.

Problem 5

Let A=(0213)A = \begin{pmatrix} 0 & -2 \newline 1 & 3 \end{pmatrix}. Find A100A^{100}. You have to find all four entries.

Problem 6

Let p(x)p(x) be the polynomial p(x)=x3+ax2+bx+cp(x) = x^3 + ax^2 + bx + c. Show that if p(r)=0p(r) = 0, then p(x)xr2p(x+1)x+1r+p(x+2)x+2r=2 \frac{p(x)}{x-r} - 2\frac{p(x+1)}{x+1-r} + \frac{p(x+2)}{x+2-r} = 2 for all xx except x=rx = r, r1r - 1 and r2r - 2.

Problem 7

Find limn2log2+3log3++nlognn2logn\displaystyle{\lim_{n \to \infty} \frac{2 \log 2 + 3 \log 3 + \dots + n \log n}{n^2 \log n}}.

Problem 8

Some goblins, NN in number, are standing in a row while “trick-or-treat”-ing. Each goblin is at all times either 22' tall or 33' 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)G(N) be the total of all occurrences of LGG’s as the row of NN goblins transmogrifies through all possible distinct configurations, where height is the only distinguishing characteristic. As an example, with N=2N = 2, the distinct configurations are 2^2^\hat{2}\hat{2}, 23^2\hat{3}, 3^2\hat{3}2, 3^3^\hat{3}\hat{3}, where a cap indicates an LGG. Thus G(2)=6G(2) = 6.

  1. Find G(3)G(3) and G(4)G(4).
  2. Find, with proof, the general formula for G(N)G(N), N=1,2,3,N = 1, 2, 3, \dots.