olymmath

Putnam 1984

William Lowell Putnam Mathematical Competition 1984.

Session A

A1

  • Session A

Let AA be a solid a×b×ca\times b\times c rectangular brick, where a,b,c>0a,b,c>0 . Let BB be the set of all points which are a distance of at most one from some point of AA . Express the volume of BB as a polynomial in a,b,a,b, and cc .

Answer, solutions and source

A2

  • Session A

Express ∑k=1∞6k(3k+1−2k+1)(3k−2k)\sum_{k=1}^\infty\frac{6^k}{(3^{k+1}-2^{k+1})(3^k-2^k)} as a rational number.

Answer, solutions and source

A4

  • Session A

A convex pentagon P=ABCDEP=ABCDE is inscribed in a circle of radius 11 . Find the maximum area of PP subject to the condition that the chords ACAC and BDBD are perpendicular.

Answer, solutions and source

A6

  • Session A

Let nn be a positive integer, and let f(n)f(n) denote the last nonzero digit in the decimal expansion of n!n! . (a)(\text a) Show that if a1,a2,…,aka_1,a_2,\ldots,a_k are distinct nonnegative integers, then f(5a1+5a2+…+5ak)f(5^{a_1}+5^{a_2}+\ldots+5^{a_k}) depends only on the sum a1+a2+…+aka_1+a_2+\ldots+a_k . (b)(\text b) Assuming part (a)(\text a) , we can define g(s)=f(5a1+5a2+…+5ak),g(s)=f(5^{a_1}+5^{a_2}+\ldots+5^{a_k}), where s=a1+a2+…+aks=a_1+a_2+\ldots+a_k . Find the least positive integer pp for which g(s)=g(s+p),for all s≥1,g(s)=g(s+p),\enspace\text{for all }s\ge1, or show that no such pp exists.

Answer, solutions and source

Session B

B1

  • Session B

Let nn be a positive integer, and define f(n)=1!+2!+…+n!f(n)=1!+2!+\ldots+n! . Find polynomials PP and QQ such that f(n+2)=P(n)f(n+1)+Q(n)f(n)f(n+2)=P(n)f(n+1)+Q(n)f(n) for all n≥1n\ge1 .

Answer, solutions and source

B2

  • Session B

Find the minimum value of(u−v)2+(2−u2−9v)2(u-v)^2+\left(\sqrt{2-u^2}-\frac{9}{v}\right)^2for 0<u<20<u<\sqrt{2} and v>0v>0

Answer, solutions and source

B3

  • Session B

Prove or disprove the following statement: If FF is a finite set with two or more elements, then there exists a binary operation ∗* on FF such that for all x,y,zx,y,z in FF , (i)(\text i) x∗z=y∗zx*z=y*z implies x=yx=y (ii)(\text{ii}) x∗(y∗z)≠(x∗y)∗zx*(y*z)\ne(x*y)*z

Answer, solutions and source

B4

  • Session B

Find, with proof, all real-valued functions y=g(x)y=g(x) defined and continuous on [0,∞)[0,\infty) , positive on (0,∞)(0,\infty) , such that for all x>0x>0 the yy -coordinate of the centroid of the region Rx={(s,t)∣0≤s≤x,0≤t≤g(s)}R_x=\{(s,t)\mid0\le s\le x,\enspace0\le t\le g(s)\} is the same as the average value of gg on [0,x][0,x] .

Answer, solutions and source

B5

  • Session B

For each nonnegative integer kk , let d(k)d(k) denote the number of 11 's in the binary expansion of kk . Let mm be a positive integer. Express ∑k=02m−1(−1)d(k)km\sum_{k=0}^{2^m-1}(-1)^{d(k)}k^m in the form (−1)maf(m)g(m)!(-1)^ma^{f(m)}g(m)! , where aa is an integer and ff and gg are polynomials.

Answer, solutions and source

B6

  • Session B

A sequence of convex polygons (Pn),n≥0,(P_n),n\ge0, is defined inductively as follows. P0P_0 is an equilateral triangle with side length 11 . Once PnP_n has been determined, its sides are trisected; the vertices of Pn+1P_{n+1} are the interior trisection points of the sides of PnP_n . Express lim⁡n→∞[Pn]\lim_{n\to\infty}[P_n] in the form ab\frac{\sqrt a}b , where a,ba,b are integers.

Answer, solutions and source