- Session A
Let and for , The first few terms are Find, with proof, a formula for of the form , where and are well-known sequences.
William Lowell Putnam Mathematical Competition 1990.
Let and for , The first few terms are Find, with proof, a formula for of the form , where and are well-known sequences.
Is the limit of a sequence of numbers of the form ()?
Prove that any convex pentagon whose vertices (no three of which are collinear) have integer coordinates must have area greater than or equal to 5/2.
Consider a paper punch that can be centered at any point of the plane and that, when operated, removes from the plane precisely those points whose distance from the center is irrational. How many punches are needed to remove every point?
If and are square matrices of the same size such that , does it follow that ?
If is a finite set, let denote the number of elements in . Call an ordered pair of subsets of admissible if for each , and for each . How many admissible ordered pairs of subsets of are there? Prove your answer.
Find all real-valued continuously differentiable functions on the real line such that for all ,
Prove that for , , where is
Let be a set of integer matrices whose entries (1) are all squares of integers and, (2) satisfy . Show that if has more than 50387 () elements, then it has two elements that commute.
Let be a finite group of order generated by and . Prove or disprove: there is a sequence such that
(1) every element of occurs exactly twice, and
(2) equals or for . (Interpret as .)
Is there an infinite sequence of nonzero real numbers such that for the polynomial has exactly distinct real roots?
Let be a nonempty closed bounded convex set in the plane. Let be a line and a positive number. Let and be support lines for parallel to , and let be the line parallel to and midway between and . Let be the band of points whose distance from is at most , where is the distance between and . What is the smallest such that for all ? ( runs over all lines in the plane.)