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

2013 China National Olympiad, 2

For any positive integer $n$ and $0 \leqslant i \leqslant n$, denote $C_n^i \equiv c(n,i)\pmod{2}$, where $c(n,i) \in \left\{ {0,1} \right\}$. Define \[f(n,q) = \sum\limits_{i = 0}^n {c(n,i){q^i}}\] where $m,n,q$ are positive integers and $q + 1 \ne {2^\alpha }$ for any $\alpha \in \mathbb N$. Prove that if $f(m,q)\left| {f(n,q)} \right.$, then $f(m,r)\left| {f(n,r)} \right.$ for any positive integer $r$.

2010 Malaysia National Olympiad, 9

Let $m$ and $n$ be positive integers such that $2^n+3^m$ is divisible by $5$. Prove that $2^m+3^n$ is divisible by $5$.

2008 Romania Team Selection Test, 1

Let $ n$ be an integer, $ n\geq 2$. Find all sets $ A$ with $ n$ integer elements such that the sum of any nonempty subset of $ A$ is not divisible by $ n\plus{}1$.

2008 China Team Selection Test, 2

Prove that for all $ n\geq 2,$ there exists $ n$-degree polynomial $ f(x) \equal{} x^n \plus{} a_{1}x^{n \minus{} 1} \plus{} \cdots \plus{} a_{n}$ such that (1) $ a_{1},a_{2},\cdots, a_{n}$ all are unequal to $ 0$; (2) $ f(x)$ can't be factorized into the product of two polynomials having integer coefficients and positive degrees; (3) for any integers $ x, |f(x)|$ isn't prime numbers.

2010 Contests, 3

For any integer $n\ge 2$, let $N(n)$ be the maximum number of triples $(a_j,b_j,c_j),j=1,2,3,\cdots ,N(n),$ consisting of non-negative integers $a_j,b_j,c_j$ (not necessarily distinct) such that the following two conditions are satisfied: (a) $a_j+b_j+c_j=n,$ for all $j=1,2,3,\cdots N(n)$; (b) $j\neq k$, then $a_j\neq a_k$, $b_j\neq b_k$ and $c_j\neq c_k$. Determine $N(n)$ for all $n\ge 2$.

2006 China Team Selection Test, 2

Prove that for any given positive integer $m$ and $n$, there is always a positive integer $k$ so that $2^k-m$ has at least $n$ different prime divisors.

1989 IMO Longlists, 86

Let $ m$ be a positive odd integer, $ m > 2.$ Find the smallest positive integer $ n$ such that $ 2^{1989}$ divides $ m^n \minus{} 1.$

2005 Kyiv Mathematical Festival, 2

Find the rightmost nonzero digit of $ \frac{100!}{5^{20}}$ (here $ n!\equal{}1\cdot2\cdot3\cdot\ldots\cdot n$).

2014 Postal Coaching, 1

Let $p$ be a prime such that $p\mid 2a^2-1$ for some integer $a$. Show that there exist integers $b,c$ such that $p=2b^2-c^2$.

2011 Turkey Junior National Olympiad, 3

$m < n$ are positive integers. Let $p=\frac{n^2+m^2}{\sqrt{n^2-m^2}}$. [b](a)[/b] Find three pairs of positive integers $(m,n)$ that make $p$ prime. [b](b)[/b] If $p$ is prime, then show that $p \equiv 1 \pmod 8$.

2005 China Team Selection Test, 3

$n$ is a positive integer, $F_n=2^{2^{n}}+1$. Prove that for $n \geq 3$, there exists a prime factor of $F_n$ which is larger than $2^{n+2}(n+1)$.

2014 Bundeswettbewerb Mathematik, 1

Show that for all positive integers $n$, the number $2^{3^n}+1$ is divisible by $3^{n+1}$.

2008 National Olympiad First Round, 14

What is the last three digits of $49^{303}\cdot 3993^{202}\cdot 39^{606}$? $ \textbf{(A)}\ 001 \qquad\textbf{(B)}\ 081 \qquad\textbf{(C)}\ 561 \qquad\textbf{(D)}\ 721 \qquad\textbf{(E)}\ 961 $

2013 Purple Comet Problems, 24

Find the remainder when $333^{333}$ is divided by $33$.

2010 Malaysia National Olympiad, 8

Find the last digit of \[7^1\times 7^2\times 7^3\times \cdots \times 7^{2009}\times 7^{2010}.\]

2008 Spain Mathematical Olympiad, 3

Let $p\ge 3$ be a prime number. Each side of a triangle is divided into $p$ equal parts, and we draw a line from each division point to the opposite vertex. Find the maximum number of regions, every two of them disjoint, that are formed inside the triangle.

Oliforum Contest IV 2013, 7

For every positive integer $n$, define the number of non-empty subsets $\mathcal N\subseteq \{1,\ldots ,n\}$ such that $\gcd(n\in\mathcal N)=1$. Show that $f(n)$ is a perfect square if and only if $n=1$.

2024 Nigerian MO Round 2, Problem 3

Find the first two values of $40!(\text{mod }1763)$ [hide=Answer]1311, 3074[\hide]

2014 ELMO Shortlist, 2

Define the Fibanocci sequence recursively by $F_1=1$, $F_2=1$ and $F_{i+2} = F_i + F_{i+1}$ for all $i$. Prove that for all integers $b,c>1$, there exists an integer $n$ such that the sum of the digits of $F_n$ when written in base $b$ is greater than $c$. [i]Proposed by Ryan Alweiss[/i]

2008 Germany Team Selection Test, 3

Find all surjective functions $ f: \mathbb{N} \to \mathbb{N}$ such that for every $ m,n \in \mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$. [i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]

2012 Online Math Open Problems, 48

Suppose that \[\sum_{i=1}^{982} 7^{i^2}\] can be expressed in the form $983q + r$, where $q$ and $r$ are integers and $0 \leq r \leq 492$. Find $r$. [i]Author: Alex Zhu[/i]

2024 Spain Mathematical Olympiad, 6

Let $a$, $b$ and $n$ be positive integers, satisfying that $bn$ divides $an-a+1$. Let $\alpha=a/b$. Prove that, when the numbers $\lfloor\alpha\rfloor,\lfloor2\alpha\rfloor,\dots,\lfloor(n-1)\alpha\rfloor$ are divided by $n$, the residues are $1,2,\dots,n-1$, in some order.

2006 JBMO ShortLists, 13

Let $ A$ be a subset of the set $ \{1, 2,\ldots,2006\}$, consisting of $ 1004$ elements. Prove that there exist $ 3$ distinct numbers $ a,b,c\in A$ such that $ gcd(a,b)$: a) divides $ c$ b) doesn't divide $ c$

1983 IMO Longlists, 27

Let $a,b$ and $c$ be positive integers, no two of which have a common divisor greater than $1$. Show that $2abc-ab-bc-ca$ is the largest integer which cannot be expressed in the form $xbc+yca+zab$, where $x,y,z$ are non-negative integers.

1993 China Team Selection Test, 1

For all primes $p \geq 3,$ define $F(p) = \sum^{\frac{p-1}{2}}_{k=1}k^{120}$ and $f(p) = \frac{1}{2} - \left\{ \frac{F(p)}{p} \right\}$, where $\{x\} = x - [x],$ find the value of $f(p).$