Problem 01
Solutions
Solution 1
Let us substitute in for to get
Now, since the domain and range of are the same, we can let and equal some constant to get
Therefore, we have found that all solutions must be of the formPlugging back into the original equation, we have: which is true. Therefore, we know that satisfies the above for any integral constant c, and that this family of equations is unique.
(This solution does not work though because we don't know that is surjective)
Solution 2
We plug in and to getrespectively.
Setting them equal to each other, we have the equationand moving "like terms" to one side of the equation yieldsSeeing that this is a difference of outputs of we can relate this to slope by dividing by on both sides. This gives uswhich means that is linear.
Let Plugging our expression into our original equation yields and letting be constant, this can only be true if If then which implies However, the output is then not all integers, so this doesn't work. If we have Plugging this in works, so the answer is for some integer
Problem 02
In triangle , point lies on side and point lies on side . Let and be points on segments and , respectively, such that is parallel to . Let be a point on line , such that lies strictly between and , and . Similarly, let be the point on line , such that lies strictly between and , and .
Prove that points , and are concyclic.
Problem 03
Problem 04
Find all pairs of positive integers such that
Solution
(when ), (when ), (when )
(when ), (when )
Hence, , satisfy
For is strictly increasing, and will never satisfy = 2 for integer n since when .
In all solutions, for any prime and positive integer , we will denote bythe exponent of the largest power of that divides . The right-hand side of will be denoted bythat is,
=
On the other hand,is expressed by the as
Thus, implies the inequalityIn order to obtain an opposite estimate, observe thatWe claim thatfor all
For the estimate (3) is true becauseand
Problem 05
The Bank of Bath issues coins with an on one side and a on the other. Harry has of these coins arranged in a line from left to right. He repeatedly performs the following operation:
If there are exactly coins showing , then he turns over the coin from the left; otherwise, all coins show and he stops. For example, if the process starting with the configuration would be , which stops after three operations.
(a) Show that, for each initial configuration, Harry stops after a finite number of operations.
(b) For each initial configuration , let be the number of operations before Harry stops. For example, and . Determine the average value of over all possible initial configurations .
No comments:
Post a Comment