Subcontests
(8)1980 VTRMC #7
Let S be the set of all ordered pairs of integers (m,n) satisfying m>0 and n<0. Let < be a partial ordering on S defined by the statement (m,n)<(m′,n′) if and only if m≤m′ and n≤n′. An example is (5,−10)<(8,−2). Now let O be a completely ordered subset of S, in other words if (a,b)∈O and (c,d)∈O, then (a,b)<(c,d) or (c,d)<(a,b). Also let O′ denote the collection of all such completely ordered sets.(a) Determine whether and arbitrary O∈O′ is finite.
(b) Determine whether the carnality ∣O∣ of O is bounded for O∈O′.
(c) Determine whether ∣O∣ can be countable infinite for any O∈O′. 1980 VTRMC #6
Given the linear fractional transformation of x into f1(x)=x+12x−1, define fn+1(x)=f1(fn(x)) for n=1,2,3,…. It can be shown that f35=f5. Determine A,B,C,D so that f28(x)=Cx+DAx+B. 1980 VTRMC #2
The sum of the first n terms of the sequence 1,1+2,1+2+22,…,1+2+⋯+2k−1,… is of the form 2n+R+Sn2+Tn+U for all n>0. Find R,S,T, and U. 1980 VTRMC #1
Let ∗ denote a binary operation on a set S with the property that (w∗x)∗(y∗z)=w∗z for all w,x,y,z∈S. Show(a) If a∗b=c, then c∗c=c.
(b) If a∗b=c, then a∗x=c∗x for all x∈S.