- Session A
Let be a solid rectangular brick, where . Let be the set of all points which are a distance of at most one from some point of . Express the volume of as a polynomial in and .
William Lowell Putnam Mathematical Competition 1984.
Let be a solid rectangular brick, where . Let be the set of all points which are a distance of at most one from some point of . Express the volume of as a polynomial in and .
Express as a rational number.
A convex pentagon is inscribed in a circle of radius . Find the maximum area of subject to the condition that the chords and are perpendicular.
Let be a positive integer, and let denote the last nonzero digit in the decimal expansion of . Show that if are distinct nonnegative integers, then depends only on the sum . Assuming part , we can define where . Find the least positive integer for which or show that no such exists.
Let be a positive integer, and define . Find polynomials and such that for all .
Find the minimum value offor and
Prove or disprove the following statement: If is a finite set with two or more elements, then there exists a binary operation on such that for all in , implies
Find, with proof, all real-valued functions defined and continuous on , positive on , such that for all the -coordinate of the centroid of the region is the same as the average value of on .
For each nonnegative integer , let denote the number of 's in the binary expansion of . Let be a positive integer. Express in the form , where is an integer and and are polynomials.
A sequence of convex polygons is defined inductively as follows. is an equilateral triangle with side length . Once has been determined, its sides are trisected; the vertices of are the interior trisection points of the sides of . Express in the form , where are integers.