Olympiad problems

2005 AIME Problems, 12

For positive integers $n$, let $\tau (n)$ denote the number of positive integer divisors of $n$, including $1$ and $n$. For example, $\tau (1)=1$ and $\tau(6) =4$. Define $S(n)$ by \[S(n)=\tau(1)+ \tau(2) + ... + \tau(n).\] Let $a$ denote the number of positive integers $n \leq 2005$ with $S(n)$ odd, and let $b$ denote the number of positive integers $n \leq 2005$ with $S(n)$ even. Find $|a-b|$.

PEN J Problems, 6

Tags: divisor function , modular arithmetic , quadratic , number theory , relatively prime , prime factorization

Show that if $m$ and $n$ are relatively prime positive integers, then $\phi( 5^m -1) \neq 5^{n}-1$.

1997 IMO, 5

Tags: equation , prime factorization , number theory

Find all pairs $ (a,b)$ of positive integers that satisfy the equation: $ a^{b^2} \equal{} b^a$.

2005 AIME Problems, 2

Tags: arithmetic sequence , number theory , prime factorization

For each positive integer $k$, let $S_k$ denote the increasing arithmetic sequence of integers whose first term is $1$ and whose common difference is $k$. For example, $S_3$ is the sequence $1,4,7,10,...$. For how many values of $k$ does $S_k$ contain the term $2005$?

2015 China Northern MO, 3

Tags: number theory , prime factorization

If $n=p_1^{a_1},p_2^{a_2}...p_s^{a_s}$ then $\phi (n)=n \left(1- \frac{1}{p_1}\right)\left(1 - \frac{1}{p_2}\right)...\left(1- \frac{1}{p_s}\right)$. Find the smallest positive integer $n$ such that $\phi (n)=\frac{2^5}{47}n.$

2006 Estonia Team Selection Test, 6

Tags: number theory , prime number , prime factorization

Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$. Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$. (a) Show that there are only finitely many pairs of consecutive highly divisible integers of the form $(a, b)$ with $a\mid b$. (b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.

1991 AMC 8, 13

Tags: number theory , prime factorization

How many zeros are at the end of the product \[25\times 25\times 25\times 25\times 25\times 25\times 25\times 8\times 8\times 8?\] $\text{(A)}\ 3 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 10 \qquad \text{(E)}\ 12$

2004 Mediterranean Mathematics Olympiad, 1

Tags: factorial , inequalities , prime factorization , number theory

Find all natural numbers $m$ such that \[1! \cdot 3! \cdot 5! \cdots (2m-1)! = \biggl( \frac{m(m+1)}{2}\biggr) !.\]