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

2024 Argentina Cono Sur TST, 6
Tags: number theory
Find all pairs of positive integers $(n, k)$ that satisfy the equation $$n!+n=n^k$$

2021 Bundeswettbewerb Mathematik, 2
Tags: reciprocal sum , number theory
The fraction $\frac{3}{10}$ can be written as a sum of two reciprocals in exactly two ways: \[\frac{3}{10}=\frac{1}{5}+\frac{1}{10}=\frac{1}{4}+\frac{1}{20}\] a) In how many ways can $\frac{3}{2021}$ be written as a sum of two reciprocals? b) Is there a positive integer $n$ not divisible by $3$ with the property that $\frac{3}{n}$ can be written as a sum of two reciprocals in exactly $2021$ ways?

2008 Indonesia TST, 4
Tags: number theory , functional equation , functional , functional equation in n
Find all pairs of positive integer $\alpha$ and function $f : N \to N_0$ that satisfies (i) $f(mn^2) = f(mn) + \alpha f(n)$ for all positive integers $m, n$. (ii) If $n$ is a positive integer and $p$ is a prime number with $p|n$, then $f(p) \ne 0$ and $f(p)|f(n)$.

1998 Baltic Way, 4
Tags: algebra , polynomial , modular arithmetic , number theory
Let $P$ be a polynomial with integer coefficients. Suppose that for $n=1,2,3,\ldots ,1998$ the number $P(n)$ is a three-digit positive integer. Prove that the polynomial $P$ has no integer roots.

ICMC 4, 2
Tags: number theory , mod p
Let $p > 3$ be a prime number. A sequence of $p-1$ integers $a_1,a_2, \dots, a_{p-1}$ is called [i]wonky[/i] if they are distinct modulo \(p\) and $a_ia_{i+2} \not\equiv a_{i+1}^2 \pmod p$ for all \(i \in \{1, 2, \dots, p-1\}\), where \(a_p = a_1\) and \(a_{p+1} = a_2\). Does there always exist a wonky sequence such that $$a_1a_2, \qquad a_1a_2+a_2a_3, \qquad \dots, \qquad a_1a_2+\cdots +a_{p-1}a_1,$$ are all distinct modulo $p$? [i]Proposed by Harun Khan[/i]

2005 Paraguay Mathematical Olympiad, 4
Tags: number theory
In the expression $t=\frac{8a+ 1}{b}$ where $a, b, t$ are positive integers, where $b <7$. Determine the values of $a$ and$ b$ that allow to obtain $t$ under the established conditions.

2010 IMC, 4
Tags: function , abstract algebra , quadratic , set theory , number theory
Let $a,b$ be two integers and suppose that $n$ is a positive integer for which the set $\mathbb{Z} \backslash \{ax^n + by^n \mid x,y \in \mathbb{Z}\}$ is finite. Prove that $n=1$.

2016 Junior Balkan Team Selection Tests - Moldova, 1
Tags: number theory
$\frac{a^3}{b^3}$+$\frac{a^3+1}{b^3+1}$+...+$\frac{a^3+2015}{b^3+2015}$=2016 b - positive integer, b can't be 0 a - real Find $\frac{a^3}{b^3}$*$\frac{a^3+1}{b^3+1}$*...*$\frac{a^3+2015}{b^3+2015}$

2022 SG Originals, Q3
Tags: functional equation , number theory , factorial , function
Find all functions $f:\mathbb{Z}^+\rightarrow \mathbb{Z}^+$ satisfying $$m!!+n!!\mid f(m)!!+f(n)!!$$for each $m,n\in \mathbb{Z}^+$, where $n!!=(n!)!$ for all $n\in \mathbb{Z}^+$. [i]Proposed by DVDthe1st[/i]

1982 Poland - Second Round, 5
Tags: number theory , divide , divisible
Let $ q $ be an even positive number. Prove that for every natural number $ n $ number $q^{(q+1)^n}+1$ is divisible by $ (q + 1)^{n+1} $ but not divisible by $ (q + 1)^{n+2} $.

2012 AMC 12/AHSME, 24
Tags: function , floor function , number theory , prime factorization
Define the function $f_1$ on the positive integers by setting $f_1(1)=1$ and if $n=p_1^{e_1}p_2^{e_2}...p_k^{e_k}$ is the prime factorization of $n>1$, then \[f_1(n)=(p_1+1)^{e_1-1}(p_2+1)^{e_2-1}\cdots (p_k+1)^{e_k-1}.\] For every $m \ge 2$, let $f_m(n)=f_1(f_{m-1}(n))$. For how many $N$ in the range $1 \le N \le 400$ is the sequence $(f_1(N), f_2(N), f_3(N),...)$ unbounded? [b]Note:[/b] a sequence of positive numbers is unbounded if for every integer $B$, there is a member of the sequence greater than $B$. $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 16 \qquad\textbf{(C)}\ 17 \qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 19 $

2015 China Team Selection Test, 3
Tags: number theory , greatest common divisor , modular arithmetic
Let $a,b$ be two integers such that their gcd has at least two prime factors. Let $S = \{ x \mid x \in \mathbb{N}, x \equiv a \pmod b \} $ and call $ y \in S$ irreducible if it cannot be expressed as product of two or more elements of $S$ (not necessarily distinct). Show there exists $t$ such that any element of $S$ can be expressed as product of at most $t$ irreducible elements.

2011 India National Olympiad, 2
Tags: number theory
Call a natural number $n$ faithful if there exist natural numbers $a<b<c$ such that $a|b,$ and $b|c$ and $n=a+b+c.$ $(i)$ Show that all but a finite number of natural numbers are faithful. $(ii)$ Find the sum of all natural numbers which are not faithful.

1998 Belarus Team Selection Test, 2
Tags: combinatorics , number theory , consecutive
The numbers $1,2,...,n$ ($n \ge 5$) are written on the circle in the clockwise order. Per move it is allowed to exchange any couple of consecutive numbers $a, b$ to the couple $\frac{a+b}{2}, \frac{a+b}{2}$. Is it possible to make all numbers equal using these operations?

1995 Argentina National Olympiad, 4
Tags: number theory , consecutive
Find the smallest natural number that is the sum of $9$ consecutive natural numbers, is the sum of $10$ consecutive natural numbers and is also the sum of $11$ consecutive natural numbers.

2021 Philippine MO, 4
Tags: number theory , algebra , polynomial
Determine the set of all polynomials $P(x)$ with real coefficients such that the set $\{P(n) | n \in \mathbb{Z}\}$ contains all integers, except possibly finitely many of them.

2022 Assara - South Russian Girl's MO, 4
Tags: greatest common divisor , number theory
Nadya has $2022$ cards, each with a number one or seven written on it. It is known that there are both cards.Nadya looked at all possible $2022$-digit numbers that can be composed from all these cards. What is the largest value that can take the greatest common divisor of all these numbers?

2018 ELMO Shortlist, 2
Tags: number theory
Call a number $n$ [i]good[/i] if it can be expressed as $2^x+y^2$ for where $x$ and $y$ are nonnegative integers. (a) Prove that there exist infinitely many sets of $4$ consecutive good numbers. (b) Find all sets of $5$ consecutive good numbers. [i]Proposed by Michael Ma[/i]

2017 Argentina National Math Olympiad Level 2, 4
Tags: number theory , prime number
Find all positive integers $a$ such that $4x^2 + a$ is prime for all $x = 0, 1, \dots, a - 1$.

2023 HMNT, 3
Tags: number theory
Compute the number of positive four-digit multiples of $11$ whose sum of digits (in base ten) is divisible by $11$.

2013 Bosnia and Herzegovina Junior BMO TST, 1
Tags: number theory , sum of squares , divisible
It is given $n$ positive integers. Product of any one of them with sum of remaining numbers increased by $1$ is divisible with sum of all $n$ numbers. Prove that sum of squares of all $n$ numbers is divisible with sum of all $n$ numbers

2017 QEDMO 15th, 9
Tags: number theory , divisible
Let $p$ be a prime number and $h$ be a natural number smaller than $p$. We set $n = ph + 1$. Prove that if $2^{n-1}-1$, but not $2^h-1$, is divisible by $n$, then $n$ is a prime number.

2011 Mongolia Team Selection Test, 1
Tags: quadratic , modular arithmetic , ring theory , diophantine equation , number theory
Let $A=\{a^2+13b^2 \mid a,b \in\mathbb{Z}, b\neq0\}$. Prove that there a) exist b) exist infinitely many $x,y$ integer pairs such that $x^{13}+y^{13} \in A$ and $x+y \notin A$. (proposed by B. Bayarjargal)

2009 Germany Team Selection Test, 3
Tags: invariant , number theory
Initially, on a board there a positive integer. If board contains the number $x,$ then we may additionally write the numbers $2x+1$ and $\frac{x}{x+2}.$ At some point 2008 is written on the board. Prove, that this number was there from the beginning.

2021 Iran Team Selection Test, 4
Tags: algebra , inequalities , function , number theory
Find all functions $f : \mathbb{N} \rightarrow \mathbb{R}$ such that for all triples $a,b,c$ of positive integers the following holds : $$f(ac)+f(bc)-f(c)f(ab) \ge 1$$ Proposed by [i]Mojtaba Zare[/i]