Back to VTRMC list Problem source: HTML (archive ) and PDF
(archive )
Problem 1# What is the remainder when X 1982 + 1 X^{1982} + 1 X 1982 + 1 is divided by X β 1 X - 1 X β 1 ? Verify your
answer.
Problem 2# A box contains marbles, each of which is red, white or blue. The number of blue
marbles is a least half the number of white marbles and at most one-third the
number of red marbles. The number which are white or blue is at least 55 55 55 .
Find the minimum possible number of red marbles.
Problem 3# Let a \bm{a} a , b \bm{b} b , and c \bm{c} c be vectors such that { a , b , c } \lbrace \bm{a},
\bm{b}, \bm{c} \rbrace { a , b , c } is linearly dependent. Show that
β£ a β
a a β
b a β
c b β
a b β
b b β
c c β
a c β
b c β
c β£ = 0
\begin{vmatrix}
\bm{a} \cdot \bm{a} & \bm{a} \cdot \bm{b} & \bm{a} \cdot \bm{c} \newline
\bm{b} \cdot \bm{a} & \bm{b} \cdot \bm{b} & \bm{b} \cdot \bm{c} \newline
\bm{c} \cdot \bm{a} & \bm{c} \cdot \bm{b} & \bm{c} \cdot \bm{c} \newline
\end{vmatrix} = 0
β£ β£ β a β
a b β
a c β
a β a β
b b β
b c β
b β a β
c b β
c c β
c β β£ β£ β = 0
Problem 4# Prove that t n β 1 + t 1 β n < t n + t β n t^{n - 1} + t^{1 - n} < t^n + t^{-n} t n β 1 + t 1 β n < t n + t β n when t β 1 t \ne 1 t ξ = 1 , t > 0 t > 0 t > 0 and
n n n is a positive integer.
Problem 5# When asked to state the Maclaurin Series, a student writes (incorrectly)
( β ) f ( x ) = f ( x ) + x f β² ( x ) + x 2 2 ! f β² β² ( x ) + x 3 3 ! f β² β² β² ( x ) + β¦ (*) \quad f(x) = f(x) + x f'(x) + \frac{x^2}{2!} f''(x) + \frac{x^3}{3!} f'''(x) + β¦ ( β ) f ( x ) = f ( x ) + x f β² ( x ) + 2 ! x 2 β f β²β² ( x ) + 3 ! x 3 β f β²β²β² ( x ) + β¦
State Maclaurinβs Series for f ( x ) f(x) f ( x ) correctly. Replace the left-hand side of ( β ) (*) ( β ) by a simple closed form expression in
f f f in such a way that the statement becomes valid (in general). Problem 6# Let S S S be a set of positive integers and let E E E be the operation on the set
of subsets of S S S defined by E A = { x β A β£ x is even } EA = \lbrace x \in A \mid x \text{ is even}
\rbrace E A = { x β A β£ x is even } , where A β S A \subseteq S A β S . Let C A CA C A denote the complement of A A A in S S S .
E C E A ECEA ECE A will denote E ( C ( E A ) ) E(C(EA)) E ( C ( E A )) , etc.
Show that E C E C E A = E A ECECEA = EA ECECE A = E A . Find the maximum number of distinct subsets of S S S that can be generated by
applying the operations E E E and C C C to a subset A A A of S S S an arbitrary number
of times in any order. Problem 7# Let p ( x ) = a x 2 + b x + c p(x) = ax^2 + bx + c p ( x ) = a x 2 + b x + c , where a a a , b b b and c c c are integers, with the
property that 1 < p ( 1 ) < p ( p ( 1 ) ) < p ( p ( p ( 1 ) ) ) 1 < p(1) < p(p(1)) < p(p(p(1))) 1 < p ( 1 ) < p ( p ( 1 )) < p ( p ( p ( 1 ))) . Show that a β₯ 0 a \ge 0 a β₯ 0 .
Problem 8# For n β₯ 2 n \ge 2 n β₯ 2 , let S n = β k = n β 1 k 2 S_n = \displaystyle{
\sum_{k = n}^\infty \frac{1}{k^2}
} S n β = k = n β β β k 2 1 β .
Prove or disprove that 1 n < S n < 1 n β 1 \dfrac{1}{n} < S_n < \dfrac{1}{n - 1} n 1 β < S n β < n β 1 1 β . Prove or disprove that S n < 1 n β 3 4 S_n < \dfrac{1}{n - \frac{3}{4}} S n β < n β 4 3 β 1 β .