This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 471

Let $A=(a_{ij})$ be the $n\times n$ matrix, where $a_{ij}$ is the remainder of the division of $i^j+j^i$ by $3$ for $i,j=1,2,\ldots,n$. Find the greatest $n$ for which $\det A\ne0$.
Find the sum of the four smallest prime divisors of $2016^{239} - 1$.
Find the greatest common divisor of the numbers \[ 2^{561}\minus{}2, 3^{561}\minus{}3, \ldots, 561^{561}\minus{}561.\]
Let $m$ be a positive integer. [b]a.[/b] Show that there exist infinitely many positive integers $k$ such that $1+km^3$ is a perfect cube and $1+kn^3$ is not a perfect cube for all positive integers $n<m$. [b]b.[/b] Let $m=p^r$ where $p \equiv 2 \pmod 3$ is a prime number and $r$ is a positive integer. Find all numbers $k$ satisfying the condition in part a.
Let $p$ be an odd prime number. For every integer $a,$ define the number $S_a = \sum^{p-1}_{j=1} \frac{a^j}{j}.$ Let $m,n \in \mathbb{Z},$ such that $S_3 + S_4 - 3S_2 = \frac{m}{n}.$ Prove that $p$ divides $m.$ [i]Proposed by Romeo Meštrović, Montenegro[/i]
For a positive integer $n$, let $\tau(n)$ and $\sigma(n)$ be the number of positive divisors of $n$ and the sum of positive divisors of $n$, respectively. let $a$ and $b$ be positive integers such that $\sigma(a^n)$ divides $\sigma(b^n)$ for all $n\in \mathbb{N}$. Prove that each prime factor of $\tau(a)$ divides $\tau(b)$. Proposed by MohammadAmin Sharifi
Solve the equation $p^2-pq-q^3=1$ in prime numbers. [i]A. Golovanov[/i]
Hi everybody! I've an interesting problem! Can you solve it? Prove [b]Erdös-Ginzburg-Ziv Theorem[/b]: [i]"Among any $2n-1$ integers, there are some $n$ whose sum is divisible by $n$."[/i]
For any set $A=\{a_1,a_2,\cdots,a_m\}$, let $P(A)=a_1a_2\cdots a_m$. Let $n={2010\choose99}$, and let $A_1, A_2,\cdots,A_n$ be all $99$-element subsets of $\{1,2,\cdots,2010\}$. Prove that $2010|\sum^{n}_{i=1}P(A_i)$.
Consider polynomials $P$ of degree $2015$, all of whose coefficients are in the set $\{0,1,\dots,2010\}$. Call such a polynomial [i]good[/i] if for every integer $m$, one of the numbers $P(m)-20$, $P(m)-15$, $P(m)-1234$ is divisible by $2011$, and there exist integers $m_{20}, m_{15}, m_{1234}$ such that $P(m_{20})-20, P(m_{15})-15, P(m_{1234})-1234$ are all multiples of $2011$. Let $N$ be the number of good polynomials. Find the remainder when $N$ is divided by $1000$. [i]Proposed by Yang Liu[/i]
Let u be a fixed positive integer. Prove that the equation $n! = u^{\alpha} - u^{\beta}$ has a finite number of solutions $(n, \alpha, \beta).$
Show that, for any integer $n$, the number $n^3 - 9n + 27$ is not divisible by $81$.
For each positive integer $n$, let \[a_n = \frac {(n + 9)!}{(n - 1)!}.\] Let $k$ denote the smallest positive integer for which the rightmost nonzero digit of $a_k$ is odd. The rightmost nonzero digit of $a_k$ is $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 3\qquad \textbf{(C)}\ 5\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 9$
Find all triples $(p, x, y)$ consisting of a prime number $p$ and two positive integers $x$ and $y$ such that $x^{p -1} + y$ and $x + y^ {p -1}$ are both powers of $p$. [i]Proposed by Belgium[/i]
Show that there do not exist natural numbers $a_1, a_2, \dots, a_{2018}$ such that the numbers \[ (a_1)^{2018}+a_2, (a_2)^{2018}+a_3, \dots, (a_{2018})^{2018}+a_1 \] are all powers of $5$ [i]Proposed by Tejaswi Navilarekallu[/i]
(a) Show that $n(n + 1)(n + 2)$ is divisible by $6$. (b) Show that $1^{2015} + 2^{2015} + 3^{2015} + 4^{2015} + 5^{2015} + 6^{2015}$ is divisible by $7$.
Consider a sequence $T_0, T_1, \dots$ of polynomials defined recursively by $T_0(x) = 2$, $T_1(x)=x$, and $T_{n+2}(x) = xT_{n+1}(x) - T_n(x)$ for each nonnegative integer $n$. Let $L_n$ be the sequence of Lucas Numbers, defined by $L_0 = 2$, $L_1 = 1$, and $L_{n+2} = L_n+L_{n+1}$ for every nonnegative integer $n$. Find the remainder when $ T_0\left( L_0 \right) + T_1 \left( L_2 \right) + T_2 \left( L_4 \right) + \dots + T_{359} \left( L_{718} \right)$ is divided by $359$. [i]Proposed by Yang Liu[/i]
Let $k \in \mathbb{Z}^+$ and set $n=2^k+1.$ Prove that $n$ is a prime number if and only if the following holds: there is a permutation $a_{1},\ldots,a_{n-1}$ of the numbers $1,2, \ldots, n-1$ and a sequence of integers $g_{1},\ldots,g_{n-1},$ such that $n$ divides $g^{a_i}_i - a_{i+1}$ for every $i \in \{1,2,\ldots,n-1\},$ where we set $a_n = a_1.$ [i]Proposed by Vasily Astakhov, Russia[/i]
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]
What is the units digit of $13^{2012}$ ? $\textbf{(A)}\hspace{.05in}1 \qquad \textbf{(B)}\hspace{.05in}3 \qquad \textbf{(C)}\hspace{.05in}5 \qquad \textbf{(D)}\hspace{.05in}7 \qquad \textbf{(E)}\hspace{.05in}9 $
Find all pairs $ (p, q)$ of primes such that $ {p}^{p}\plus{}{q}^{q}\plus{}1$ is divisible by $ pq$.
Let $ a,b,c$ be positive integers. If $ 30|a\plus{}b\plus{}c$, prove that $ 30|a^5\plus{}b^5\plus{}c^5$.
Find all functions $f : Z \to Z$ satisfying $\bullet$ $ f(p) > 0$ for all prime numbers $p$, $\bullet$ $p| (f(x) + f(p))^{f(p)}- x$ for all $x \in Z$ and all prime numbers $p$.