Back to VTRMC list
Problem source: HTML (archive) and PDF (archive)

Problem 1

Show that the right circular cylinder of volume VV which has the least surface area is the one whose diameter is equal to its altitude. (The top and bottom are part of the surface.)

Problem 2

Let SS be a set which is closed under the binary operation \circ, with the following properties:

  1. there is an element eSe \in S such that ae=ea=aa \circ e = e \circ a = a, for each aSa \in S,

  2. (ab)(cd)=(ac)(bd)(a \circ b) \circ (c \circ d) = (a \circ c) \circ (b \circ d), for all a,b,c,dSa, b, c, d \in S.

Prove or disprove:

  1. \circ is associative on SS
  2. \circ is commutative on SS

Problem 3

Let AA be an n×nn \times n nonsingular matrix with complex elements, and let Aˉ\bar{A} be its complex conjugate. Let B=AAˉ+IB = A\bar{A} + I, where II is the n×nn \times n identity matrix.

Prove or disprove:

  1. A1BA=BˉA^{-1}BA = \bar{B}
  2. The determinant of AAˉ+IA \bar{A} + I is real.

Problem 4

Let f(x)f(x) be continuously differentiable on (0,)(0, \infty) and suppose limxf(x)=0\displaystyle{ \lim_{x \to \infty} f'(x) = 0 }.

Prove that limxf(x)x=0\displaystyle{ \lim_{x \to \infty} \frac{f(x)}{x} = 0 }.

Problem 5

Show, for all positive integers n=1,2,n = 1, 2,…, that 1414 divides 34n+2+52n+13^{4n + 2} + 5^{2n + 1}.

Problem 6

Suppose an>0a_n > 0 and n=1an\displaystyle{ \sum_{n = 1}^\infty a_n } diverges. Determine whether n=1anSn2\displaystyle{ \sum_{n = 1}^\infty \frac{a_n}{S_n^2} } converges, where Sn=a1+a2++anS_n = a_1 + a_2 + … + a_n.

Problem 7

Let SS be a finite set of non-negative integers such that xyS| x - y| \in S for all x,ySx, y \in S.

  1. Give an example of such a set which contains ten elements.
  2. If AA is a subset of SS containing more than two-thirds of the elements of SS, prove or disprove that every element of SS is the sum or difference of two elements from AA.

Problem 8

Let SS be a finite set of polynomials in two variables, xx and yy. For nn a positive integer, define Ωn(S)\Omega_n(S) to be the collection of all expressions p1p2pkp_1 p_2 … p_k, where piSp_i \in S and 1kn1 \le k \le n. Let dn(S)d_n(S) indicate the maximum number of linearly independent polynomials in Ωn(S)\Omega_n(S). For example, Ω2({x2,y})={x2,y,x2y,x4,y2}\Omega_2(\lbrace x^2, y \rbrace) = \lbrace x^2, y, x^2 y, x^4, y^2 \rbrace and d2({x2,y})=5d_2(\lbrace x^2, y \rbrace) = 5.

  1. Find d2({1,x,x+1,y})d_2(\lbrace 1, x, x + 1, y \rbrace).

  2. Find a closed formula in nn for dn({1,x,y})d_n(\lbrace 1, x, y \rbrace).

  3. Calculate the least upper bound over all such sets of lim supnlogdn(S)logn\displaystyle{ \limsup_{n \to \infty} \frac{\log d_n(S)}{\log n} }.

    lim supnan=limn(sup{an,an+1,})\displaystyle{ \limsup_{n \to \infty} a_n = \lim_{n \to \infty}(\sup \lbrace a_n, a_{n + 1}, … \rbrace) }, where sup\sup means supremum or least upper bound.