Fisier 11
Fisier 11
Fisier 11
PROBLEMS, U.S.A.
Ramona Cioran
Solution:
Solution:
Z ∞ Z ∞ Z ∞Z π
arctan (πx) − arctan x 1 π 1
dx = ·arctan ux dx = dudx =
x x 1 1 + (xu) 2
Z0 π Z ∞ Z π 0
π
0 1
1 1π π π
dxdu = du = ln u = ln π.
1 + (xu)2 u 2 2 1 2
1 0 1
3. Let f (n) = gcd{k n −k|k = 2, 3, 4, ..}, for n > 2. Evaluate f (n). In particular,
AMM, 1981
Solution:
1) f (n) cannot contain a factor p2 for any prime p(p > 2) because p2 - k(k n−1 −1)
2
for k = p.
for every k. Thus, if P is the product of the distinct odd primes p such that
AMM, 1981
Solution:
Z π Z π
We have first A(0) = sin x · (4 cos2 x − 1)dx = (1 − 4 cos2 x) · (cos x)0 dx =
π 0 0
4 cos3 x
2
cos x − = 3 > 0.
3 0
3
We also have A(h) > 0 for < h < 2, since the integrand in this case is positive
2
throughout the range of integration.
Z 1
Now let w = 1−2 cos x. Then, by straightforward calculation, A(1) = F (w)dw,
s −1
1 (3 + w)(1 − w)
where F (w) = w(2 + w) .
2 (3 − w)(1 + w)
w2 (1 + w2 )
Finally, since F (w) + F (−w) = − p , we see that A(1) < 0.
(9 − w2 )(1 − w2 )
But A(h) is continuous and must therefore have at least one zero in each of the
3
intervals (0,1) and (1, ).
2
5. Let pn be the probability that c + d is a perfect square when the integers c
and d are selected independently at random from the set (1,2,3,..,n). Show that
3
√ √
lim (pn n) exists and express this limit in the form r( s − t), where s and t
n→∞
Solution:
√ √
Let a(n) = [ n + 1] and b(n) = [ 2n]. For t in {1, 2, .., a(n)} there are
For t in {1 + a(n), 2 + a(n), .., b(n)} there are 2n + 1 − t2 ordered pairs (c, d)
Prove that Sx converges to a number g(x) and that the function g defined this
Solution:
1
Since the derivative of x x is negative for x > e, ab > ba when e 6 a < b. (1)
4
Also, (2) and (1) imply (u1 )u2 − (u0 )u1 > (u1 )u0 , which gives us u2 > u0 . Now
Also, (2) and (1) imply (u2 )u3 = (u1 )u2 < (u2 )u1 and hence u3 < u1 .
Similarly, u2 < u4 < u3 . Then an easy induction shows that e < u2n < u2n+2 <
Hence lim un exists and is the unique real number g = g(x) with g > e and
n→∞
g g = x.
Since f (y) = y y is continuous and strictly increasing for y > e, its inverse func-
AMM, 1982
5
Solution:
Let R(x) denote the column vector R(x) = (1, x, x2 , .., xn−1 )T .
Set Rjk = R(xj +kh) and let ∆ be the forward difference operator on the second
Then V (h) = det[R00 , R01 , .., R0,n0 −1 , R10 , .., Rm0 , Rm1 , .., Rm,nm −1 ] =
= det[R00 , ∆R00 , .., ∆n0 −1 R00 , R10 , .., Rm0 , ∆Rm0 , .., ∆nm −1 Rm0 ].