olymmath

VTRMC 1980

Virginia Tech Regional Mathematics Contest 1980.

Official paper

The official paper in 1 language

English

Other problems

Problem 1

Let ∗* denote a binary operation on a set SS with the property that (w∗x)∗(y∗z)=w∗z(w*x)*(y*z) = w * z for all w,x,y,z∈S.w,x,y,z\in S. Show

(a) If a∗b=c,a*b=c, then c∗c=c.c*c = c. (b) If a∗b=c,a*b=c, then a∗x=c∗xa*x=c*x for all x∈S.x\in S.

Problem 2

The sum of the first nn terms of the sequence 1,1+2,1+2+22,…,1+2+⋯+2k−1,…1,1+2,1+2+2^2,\ldots,1+2+\cdots+2^{k-1},\ldots is of the form 2n+R+Sn2+Tn+U2^{n+R}+Sn^2+Tn+U for all n>0.n>0. Find R,S,T,R,S,T, and U.U.

Problem 3

Let an=1⋅3⋅5⋅⋯⋅(2n−1)2⋅4⋅6⋅⋯⋅2n.a_n = \frac{1\cdot3\cdot5\cdot\cdots\cdot(2n-1)}{2\cdot4\cdot6\cdot\cdots\cdot2n}. (a) Prove that lim⁡n→∞an\lim_{n\to \infty}a_n exists. (b) Show that an=(1−122)(1−142)(1−162)⋯(1−1(2n)2)(2n+1)an.a_n = \frac{\left(1-\frac1{2^2}\right)\left(1-\frac1{4^2}\right)\left(1-\frac1{6^2}\right)\cdots\left(1-\frac{1}{(2n)^2}\right)}{(2n+1)a_n}. (c) Find lim⁡n→∞an\lim_{n\to\infty}a_n and justify your answer

Problem 4

Let P(x)P(x) be any polynomial of degree at most 3.3. It can be shown that there are numbers x1x_1 and x2x_2 such that ∫−11P(x) dx=P(x1)+P(x2),\int_{-1}^1 P(x) \ dx = P(x_1) + P(x_2), where x1x_1 and x2x_2 are independent of the polynomial P.P. (a) Show that x1=−x2.x_1=-x_2. (b) Find x1x_1 and x2.x_2.

Problem 5

For x>0,x>0, show that ex<(1+x)1+x.e^x < (1+x)^{1+x}.

Problem 6

Given the linear fractional transformation of xx into f1(x)=2x−1x+1,f_1(x) = \tfrac{2x-1}{x+1}, define fn+1(x)=f1(fn(x))f_{n+1}(x) = f_1(f_n(x)) for n=1,2,3,….n=1,2,3,\ldots. It can be shown that f35=f5.f_{35} = f_5. Determine A,B,C,DA,B,C,D so that f28(x)=Ax+BCx+D.f_{28}(x) = \tfrac{Ax+B}{Cx+D}.

Problem 7

Let SS be the set of all ordered pairs of integers (m,n)(m,n) satisfying m>0m>0 and n<0.n<0. Let << be a partial ordering on SS defined by the statement (m,n)<(m′,n′)(m,n)<(m',n') if and only if m≤m′m\le m' and n≤n′.n\le n'. An example is (5,−10)<(8,−2).(5,-10)<(8,-2). Now let OO be a completely ordered subset of S,S, in other words if (a,b)∈O(a,b)\in O and (c,d)∈O,(c,d) \in O, then (a,b)<(c,d)(a,b)<(c,d) or (c,d)<(a,b).(c,d)<(a,b). Also let O′O' denote the collection of all such completely ordered sets.

(a) Determine whether and arbitrary O∈O′O\in O' is finite. (b) Determine whether the carnality ∣O∣|O| of OO is bounded for O∈O′.O\in O'. (c) Determine whether ∣O∣|O| can be countable infinite for any O∈O′.O\in O'.

Problem 8

Let z=x+iyz=x+iy be a complex number with xx and yy rational and with ∣z∣=1.|z| = 1. (a) Find two such complex numbers. (b) Show that ∣z2n−1∣=2∣sin⁡nθ∣,|z^{2n}-1|=2|\sin n\theta|, where z=eiθ.z=e^{i\theta}. (c) Show that ∣z2n−1∣|z^2n -1| is rational for every n.n.