Subcontests
(12)Putnam 1986 B6
Suppose A,B,C,D are n×n matrices with entries in a field F, satisfying the conditions that ABT and CDT are symmetric and ADT−BCT=I. Here I is the n×n identity matrix, and if M is an n×n matrix, MT is its transpose. Prove that ATD−CTB=I. Putnam 1986 B5
Let f(x,y,z)=x2+y2+z2+xyz. Let p(x,y,z),q(x,y,z), r(x,y,z) be polynomials with real coefficients satisfying
f(p(x,y,z),q(x,y,z),r(x,y,z))=f(x,y,z).
Prove or disprove the assertion that the sequence p,q,r consists of some permutation of ±x,±y,±z, where the number of minus signs is 0 or 2. Putnam 1986 B3
Let Γ consist of all polynomials in x with integer coefficients. For f and g in Γ and m a positive integer, let f≡g(modm) mean that every coefficient of f−g is an integral multiple of m. Let n and p be positive integers with p prime. Given that f,g,h,r and s are in Γ with rf+sg≡1(modp) and fg≡h(modp), prove that there exist F and G in Γ with F≡f(modp), G≡g(modp), and FG≡h(modpn). Putnam 1986 B2
Prove that there are only a finite number of possibilities for the ordered triple T=(x−y,y−z,z−x), where x,y,z are complex numbers satisfying the simultaneous equations
x(x−1)+2yz=y(y−1)+2zx=z(z−1)+2xy,
and list all such triples T. Putnam 1986 A6
Let a1,a2,…,an be real numbers, and let b1,b2,…,bn be distinct positive integers. Suppose that there is a polynomial f(x) satisfying the identity
(1−x)nf(x)=1+i=1∑naixbi.
Find a simple expression (not involving any sums) for f(1) in terms of b1,b2,…,bn and n (but independent of a1,a2,…,an). Putnam 1986 A5
Suppose f1(x),f2(x),…,fn(x) are functions of n real variables x=(x1,…,xn) with continuous second-order partial derivatives everywhere on Rn. Suppose further that there are constants cij such that
∂xj∂fi−∂xi∂fj=cij
for all i and j, 1≤i≤n, 1≤j≤n. Prove that there is a function g(x) on Rn such that fi+∂g/∂xi is linear for all i, 1≤i≤n. (A linear function is one of the form a0+a1x1+a2x2+⋯+anxn.) Putnam 1986 A4
A transversal of an n×n matrix A consists of n entries of A, no two in the same row or column. Let f(n) be the number of n×n matrices A satisfying the following two conditions:(a) Each entry αi,j of A is in the set {−1,0,1}.
(b) The sum of the n entries of a transversal is the same for all transversals of A.An example of such a matrix A is
A=−100011−100.
Determine with proof a formula for f(n) of the form
f(n)=a1b1n+a2b2n+a3b3n+a4,
where the ai's and bi's are rational numbers.