olymmath

VTRMC 2005

Virginia Tech Regional Mathematics Contest 2005.

Other problems

Problem 1

Find the largest positive integer nn with the property that n+6(p3+1)n+6(p^3+1) is prime whenever pp is a prime number such that 2≤p<n2\le p<n . Justify your answer.

Problem 2

Find, and write out explicitly, a permutation {p(1),p(2),…,p(20)}\{p(1),p(2),\ldots,p(20)\} of {1,2,…,20}\{1,2,\ldots,20\} such that k+p(k)k+p(k) is a power of 22 for k=1,2,…,20k=1,2,\ldots,20 , and prove that only one such permutation exists.

Problem 3

We wish to tile a strip of nn 11 -inch by 11 -inch squares. We can use dominos which are made up of two tiles that cover two adjacent squares, or 11 -inch square tiles which cover one square. We may cover each square with one or two tiles and a tile can be above or below a domino on a square, but no part of a domino can be placed on any part of a different domino. We do not distinguish whether a domino is above or below a tile on a given square. Let t(n)t(n) denote the number of ways the strip can be tiled according to the above rules. Thus for example, t(1)=2t(1)=2 and t(2)=8t(2)=8 . Find a recurrence relation for t(n)t(n) , and use it to compute t(6)t(6) .

Problem 4

A cubical box with sides of length 77 has vertices at (0,0,0)(0,0,0) , (7,0,0)(7,0,0) , (0,7,0)(0,7,0) , (7,7,0)(7,7,0) , (0,0,7)(0,0,7) , (7,0,7)(7,0,7) , (0,7,7)(0,7,7) , (7,7,7)(7,7,7) . The inside of the box is lined with mirrors and from the point (0,1,2)(0,1,2) , a beam of light is directed to the point (1,3,4)(1,3,4) . The light then reflects repeatedly off the mirrors on the inside of the box. Determine how far the beam of light travels before it first returns to its starting point at (0,1,2)(0,1,2) .

Problem 5

Define f(x,y)=xyx2+y2ln⁡(x2)2f(x,y)=\frac{xy}{x^2+y^2\ln(x^2)^2} if x≠0x\ne0 , and f(0,y)=0f(0,y)=0 if y≠0y\ne0 . Determine whether lim⁡(x,y)→(0,0)f(x,y)\lim_{(x,y)\to(0,0)}f(x,y) exists, and find its value is if the limit does exist.

Problem 6

Compute ∫01((e−1)ln⁡(1+ex−x)+ex2)dx\int^1_0\left((e-1)\sqrt{\ln(1+ex-x)}+e^{x^2}\right)dx .

Problem 7

Let AA be a 5×105\times10 matrix with real entries, and let ATA^{\text T} denote its transpose. Suppose every 5×15\times1 matrix with real entries can be written in the form AuA\mathbf u where u\mathbf u is a 10×110\times1 matrix with real entries. Prove that every 5×15\times1 matrix with real entries can be written in the form AATvAA^{\text T}\mathbf v where v\mathbf v is a 5×15\times1 matrix with real entries.