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: 1766

2001 Taiwan National Olympiad, 5
Tags: function , algebra , polynomial , induction , number theory proposed , number theory
Let $f(n)=\sum_{k=0}^{n-1}x^ky^{n-1-k}$ with, $x$, $y$ real numbers. If $f(n)$, $f(n+1)$, $f(n+2)$, $f(n+3)$, are integers for some $n$, prove $f(n)$ is integer for all $n$.

2017 Bulgaria JBMO TST, 2
Tags: number theory , number theory proposed
Solve the following equation over the integers $$ 25x^2y^2+10x^2y+25xy^2+x^2+30xy+2y^2+5x+7y+6= 0.$$

2010 Contests, 2
Tags: algebra , polynomial , floor function , number theory proposed , number theory
Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$. [i]Evan O' Dorney.[/i]

2010 Indonesia TST, 1
Tags: algebra , polynomial , number theory proposed , number theory
Let $ f$ be a polynomial with integer coefficients. Assume that there exists integers $ a$ and $ b$ such that $ f(a)\equal{}41$ and $ f(b)\equal{}49$. Prove that there exists an integer $ c$ such that $ 2009$ divides $ f(c)$. [i]Nanang Susyanto, Jogjakarta[/i]

2012 ELMO Shortlist, 2
Tags: function , number theory , relatively prime , number theory proposed
For positive rational $x$, if $x$ is written in the form $p/q$ with $p, q$ positive relatively prime integers, define $f(x)=p+q$. For example, $f(1)=2$. a) Prove that if $f(x)=f(mx/n)$ for rational $x$ and positive integers $m, n$, then $f(x)$ divides $|m-n|$. b) Let $n$ be a positive integer. If all $x$ which satisfy $f(x)=f(2^nx)$ also satisfy $f(x)=2^n-1$, find all possible values of $n$. [i]Anderson Wang.[/i]

2008 Hong Kong TST, 3
Tags: number theory proposed , number theory
Prove that there are infinitely many primes $ p$ such that the total number of solutions mod $ p$ to the equation $ 3x^{3}\plus{}4y^{4}\plus{}5z^{3}\minus{}y^{4}z \equiv 0$ is $ p^2$

2009 Regional Competition For Advanced Students, 4
Tags: geometric sequence , number theory proposed , number theory
Two infinite arithmetic progressions are called considerable different if the do not only differ by the absence of finitely many members at the beginning of one of the sequences. How many pairwise considerable different non-constant arithmetic progressions of positive integers that contain an infinite non-constant geometric progression $ (b_n)_{n\ge0}$ with $ b_2\equal{}40 \cdot 2009$ are there?

2009 ITAMO, 1
Tags: number theory proposed , number theory
Let $a < b < c < d < e$ be real numbers. We calculate all possible sums in pairs of these 5 numbers. Of these 10 sums, the three smaller ones are 32, 36, 37, while the two larger ones are 48 and 51. Determine all possible values ​​that $e$ can take.

2010 Kazakhstan National Olympiad, 1
Tags: modular arithmetic , geometry , number theory proposed , number theory
It is given that for some $n \in \mathbb{N}$ there exists a natural number $a$, such that $a^{n-1} \equiv 1 \pmod{n}$ and that for any prime divisor $p$ of $n-1$ we have $a^{\frac{n-1}{p}} \not \equiv 1 \pmod{n}$. Prove that $n$ is a prime.

2007 Iran Team Selection Test, 1
Tags: algebra , polynomial , number theory proposed , number theory
Does there exist a a sequence $a_{0},a_{1},a_{2},\dots$ in $\mathbb N$, such that for each $i\neq j, (a_{i},a_{j})=1$, and for each $n$, the polynomial $\sum_{i=0}^{n}a_{i}x^{i}$ is irreducible in $\mathbb Z[x]$? [i]By Omid Hatami[/i]

2012 Junior Balkan Team Selection Tests - Moldova, 4
Tags: induction , number theory proposed , number theory
Let there be an infinite sequence $ a_{k} $ with $ k\geq 1 $ defined by: $ a_{k+2} = a_{k} + 14 $ and $ a_{1} = 12 $ , $ a_{2} = 24 $. [b]a)[/b] Does $2012$ belong to the sequence? [b]b)[/b] Prove that the sequence doesn't contain perfect squares.

2000 Baltic Way, 15
Tags: induction , number theory proposed , number theory
Let $n$ be a positive integer not divisible by $2$ or $3$. Prove that for all integers $k$, the number $(k+1)^n-k^n-1$ is divisible by $k^2+k+1$.

2013 Canadian Mathematical Olympiad Qualification Repechage, 5
Tags: number theory proposed , number theory
For each positive integer $k$, let $S(k)$ be the sum of its digits. For example, $S(21) = 3$ and $S(105) = 6$. Let $n$ be the smallest integer for which $S(n) - S(5n) = 2013$. Determine the number of digits in $n$.

2006 Germany Team Selection Test, 1
Tags: Euler , number theory proposed , number theory
For any positive integer $n$, let $w\left(n\right)$ denote the number of different prime divisors of the number $n$. (For instance, $w\left(12\right)=2$.) Show that there exist infinitely many positive integers $n$ such that $w\left(n\right)<w\left(n+1\right)<w\left(n+2\right)$.

2006 Romania Team Selection Test, 3
Tags: modular arithmetic , induction , number theory proposed , number theory
For which pairs of positive integers $(m,n)$ there exists a set $A$ such that for all positive integers $x,y$, if $|x-y|=m$, then at least one of the numbers $x,y$ belongs to the set $A$, and if $|x-y|=n$, then at least one of the numbers $x,y$ does not belong to the set $A$? [i]Adapted by Dan Schwarz from A.M.M.[/i]

2007 Iran MO (3rd Round), 6
Tags: number theory proposed , number theory
Something related to this [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=845756#845756]problem[/url]: Prove that for a set $ S\subset\mathbb N$, there exists a sequence $ \{a_{i}\}_{i \equal{} 0}^{\infty}$ in $ S$ such that for each $ n$, $ \sum_{i \equal{} 0}^{n}a_{i}x^{i}$ is irreducible in $ \mathbb Z[x]$ if and only if $ |S|\geq2$. [i]By Omid Hatami[/i]

2008 Romania National Olympiad, 4
Tags: number theory , number theory proposed
We consider the proposition $ p(n)$: $ n^2\plus{}1$ divides $ n!$, for positive integers $ n$. Prove that there are infinite values of $ n$ for which $ p(n)$ is true, and infinite values of $ n$ for which $ p(n)$ is false.

2011 Iran MO (3rd Round), 6
Tags: function , number theory proposed , number theory
$a$ is an integer and $p$ is a prime number and we have $p\ge 17$. Suppose that $S=\{1,2,....,p-1\}$ and $T=\{y|1\le y\le p-1,ord_p(y)<p-1\}$. Prove that there are at least $4(p-3)(p-1)^{p-4}$ functions $f:S\longrightarrow S$ satisfying $\sum_{x\in T} x^{f(x)}\equiv a$ $(mod$ $p)$. [i]proposed by Mahyar Sefidgaran[/i]

2010 Iran MO (3rd Round), 2
Tags: abstract algebra , calculus , integration , algebra , function , domain , number theory proposed
$R$ is a ring such that $xy=yx$ for every $x,y\in R$ and if $ab=0$ then $a=0$ or $b=0$. if for every Ideal $I\subset R$ there exist $x_1,x_2,..,x_n$ in $R$ ($n$ is not constant) such that $I=(x_1,x_2,...,x_n)$, prove that every element in $R$ that is not $0$ and it's not a unit, is the product of finite irreducible elements.($\frac{100}{6}$ points)

2010 Contests, 1
Tags: modular arithmetic , number theory proposed , number theory
Suppose that $m$ and $k$ are non-negative integers, and $p = 2^{2^m}+1$ is a prime number. Prove that [b](a)[/b] $2^{2^{m+1}p^k} \equiv 1$ $(\text{mod } p^{k+1})$; [b](b)[/b] $2^{m+1}p^k$ is the smallest positive integer $n$ satisfying the congruence equation $2^n \equiv 1$ $(\text{mod } p^{k+1})$.

2002 All-Russian Olympiad, 4
Tags: number theory proposed , number theory
Prove that there exist infinitely many natural numbers $ n$ such that the numerator of $ 1 \plus{} \frac {1}{2} \plus{} \frac {1}{3} \plus{} \frac {1}{4} \plus{} ... \plus{} \frac {1}{n}$ in the lowest terms is not a power of a prime number.

2011 Canada National Olympiad, 1
Tags: modular arithmetic , number theory proposed , number theory
Consider $70$-digit numbers with the property that each of the digits $1,2,3,...,7$ appear $10$ times in the decimal expansion of $n$ (and $8,9,0$ do not appear). Show that no number of this form can divide another number of this form.

1993 All-Russian Olympiad, 1
Tags: modular arithmetic , parameterization , quadratics , number theory proposed , number theory
For integers $x$, $y$, and $z$, we have $(x-y)(y-z)(z-x)=x+y+z$. Prove that $27|x+y+z$.

2013 China Second Round Olympiad, 1
Tags: modular arithmetic , number theory proposed , number theory , China , BPSQ
For any positive integer $n$ , Prove that there is not exist three odd integer $x,y,z$ satisfing the equation $(x+y)^n+(y+z)^n=(x+z)^n$.

2009 Junior Balkan Team Selection Test, 4
Tags: induction , number theory proposed , number theory
In the decimal expression of a $ 2009$-digit natural number there are only the digits $ 5$ and $ 8$. Prove that we can get a $ 2008$-digit number divisible by $ 11$ if we remove just one digit from the number.