olymmath

VTRMC 2018

Virginia Tech Regional Mathematics Contest 2018.

Other problems

Problem 1

It is known that ∫12x−1arctan⁡(1+x) dx=qπln⁡(2)\int_1^2x^{-1}\arctan (1+x)\ dx = q\pi\ln(2) for some rational number q.q. Determine q.q. Here, 0≤arctan⁡(x)<π20\leq\arctan(x)<\frac{\pi}{2} for 0≤x<∞.0\leq x <\infty.

Problem 2

Let A,B∈M6(Z)A, B \in M_6 (\mathbb{Z} ) such that A≡I≡B mod 3A \equiv I \equiv B \text{ mod }3 and A3B3A3=B3A^3 B^3 A^3 = B^3 . Prove that A=IA = I . Here M6(Z)M_6 (\mathbb{Z} ) indicates the 66 by 66 matrices with integer entries, II is the identity matrix, and X≡Y mod 3X \equiv Y \text{ mod }3 means all entries of X−YX-Y are divisible by 33 .

Problem 3

Prove that there is no function f:N→Nf:\mathbb{N}\rightarrow \mathbb{N} such that f(f(n))=n+1.f(f(n))=n+1. Here N\mathbb{N} is the positive integers {1,2,3,… }.\{1,2,3,\dots\}.

Problem 4

Let m,nm, n be integers such that n≥m≥1n \geq m \geq 1 . Prove that gcd(m,n)n(nm)\frac{\text{gcd} (m,n)}{n} \binom{n}{m} is an integer. Here gcd\text{gcd} denotes greatest common divisor and (nm)=n!m!(n−m)!\binom{n}{m} = \frac{n!}{m!(n-m)!} denotes the binomial coefficient.

Problem 5

For n∈Nn \in \mathbb{N} , let an=∫01/n∣1+eit+e2it+⋯+enit∣ dta_n = \int _0 ^{1/\sqrt{n}} | 1 + e^{it} + e^{2it} + \dots + e^{nit} | \ dt . Determine whether the sequence (an)=a1,a2,…(a_n) = a_1, a_2, \dots is bounded.

Problem 6

For n∈Nn \in \mathbb{N} , define an=1+1/3+1/5+⋯+1/(2n−1)n+1a_n = \frac{1 + 1/3 + 1/5 + \dots + 1/(2n-1)}{n+1} and bn=1/2+1/4+1/6+⋯+1/(2n)nb_n = \frac{1/2 + 1/4 + 1/6 + \dots + 1/(2n)}{n} . Find the maximum and minimum of an−bna_n - b_n for 1≤n≤9991 \leq n \leq 999 .

Problem 7

A continuous function f:[a,b]→[a,b]f : [a,b] \to [a,b] is called piecewise monotone if [a,b][a, b] can be subdivided into finitely many subintervals I1=[c0,c1],I2=[c1,c2],…,Iℓ=[cℓ−1,cℓ]I_1 = [c_0,c_1], I_2 = [c_1,c_2], \dots , I_\ell = [ c_{\ell - 1},c_\ell ] such that ff restricted to each interval IjI_j is strictly monotone, either increasing or decreasing. Here we are assuming that a=c0<c1<⋯<cℓ−1<cℓ=ba = c_0 < c_1 < \cdots < c_{\ell - 1} < c_\ell = b . We are also assuming that each IjI_j is a maximal interval on which ff is strictly monotone. Such a maximal interval is called a lap of the function ff , and the number ℓ=ℓ(f)\ell = \ell (f) of distinct laps is called the lap number of ff . If f:[a,b]→[a,b]f : [a,b] \to [a,b] is a continuous piecewise-monotone function, show that the sequence (ℓ(fn)n)( \sqrt[n]{\ell (f^n )}) converges; here fnf^n means ff composed with itself nn -times, so f2(x)=f(f(x))f^2 (x) = f(f(x)) etc.