Found problems: 700
Let $b,n > 1$ be integers. Suppose that for each $k > 1$ there exists an integer $a_k$ such that $b - a^n_k$ is divisible by $k$. Prove that $b = A^n$ for some integer $A$.
[i]Author: Dan Brown, Canada[/i]
Find the number of polynomials $f(x)=ax^3+bx$ satisfying both following conditions:
(i) $a,b\in\{1,2,\ldots,2013\}$;
(ii) the difference between any two of $f(1),f(2),\ldots,f(2013)$ is not a multiple of $2013$.
For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$
Given an arbitrary prime $p>2011$. Prove that there exist positive integers $a, b, c$ not all divisible by $p$ such that for all positive integers $n$ that $p\mid n^4- 2n^2+ 9$, we have $p\mid 24an^2 + 5bn + 2011c$.
Let $ b$ be an integer greater than $ 5$. For each positive integer $ n$, consider the number \[ x_n = \underbrace{11\cdots1}_{n \minus{} 1}\underbrace{22\cdots2}_{n}5, \] written in base $ b$.
Prove that the following condition holds if and only if $ b \equal{} 10$: [i]there exists a positive integer $ M$ such that for any integer $ n$ greater than $ M$, the number $ x_n$ is a perfect square.[/i]
[i]Proposed by Laurentiu Panaitopol, Romania[/i]
Let $f(x) = 3x^2 + 1$. Prove that for any given positive integer $n$, the product
$$f(1)\cdot f(2)\cdot\dots\cdot f(n)$$
has at most $n$ distinct prime divisors.
[i]Proposed by Géza Kós[/i]
A positive integer $n$ is called [i]guayaquilean[/i] if the sum of the digits of $n$ is equal to the sum of the digits of $n^2$. Find all the possible values that the sum of the digits of a guayaquilean number can take.
(Wolstenholme's Theorem) Prove that if \[1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{p-1}\] is expressed as a fraction, where $p \ge 5$ is a prime, then $p^{2}$ divides the numerator.
Let $n$ be a positive integer such that the sum of all its positive divisors (inclusive of $n$) equals to $2n + 1$. Prove that $n$ is an odd perfect square.
related:
https://artofproblemsolving.com/community/c6h515011
https://artofproblemsolving.com/community/c6h108341 (Putnam 1976)
https://artofproblemsolving.com/community/c6h368488
https://artofproblemsolving.com/community/c6h445330
https://artofproblemsolving.com/community/c6h378928
[b]6.[/b] Let $a$ be a positive integer and $p$ a prime divisor of $a^3-3a+1$, with $p \neq 3$. Prove that $p$ is of the form $9k+1$ or $9k-1$, where $k$ is integer.
Determine all natural numbers $n$ such that for each natural number $a$ relatively prime with $n$ and $a \le 1 + \left\lfloor \sqrt{n} \right\rfloor$ there exists some integer $x$ with $a \equiv x^2 \mod n$.
Remark: "Natural numbers" is the set of positive integers.
Let $p$ be an odd prime and $x$ be an integer such that $p \mid x^3 - 1$ but $p \nmid x - 1$. Prove that \[ p \mid (p - 1)!\left(x - \frac {x^2}{2} + \frac {x^3}{3} - \cdots - \frac {x^{p - 1}}{p - 1}\right).\][i]John Berman[/i]
Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$.
[i]Proposed by Jaroslaw Wroblewski, Poland[/i]
Let $ p \geq 2$ be a prime number. Eduardo and Fernando play the following game making moves alternately: in each move, the current player chooses an index $i$ in the set $\{0,1,2,\ldots, p-1 \}$ that was not chosen before by either of the two players and then chooses an element $a_i$ from the set $\{0,1,2,3,4,5,6,7,8,9\}$. Eduardo has the first move. The game ends after all the indices have been chosen .Then the following number is computed:
$$M=a_0+a_110+a_210^2+\cdots+a_{p-1}10^{p-1}= \sum_{i=0}^{p-1}a_i.10^i$$.
The goal of Eduardo is to make $M$ divisible by $p$, and the goal of Fernando is to prevent this.
Prove that Eduardo has a winning strategy.
[i]Proposed by Amine Natik, Morocco[/i]
Does there exist a natural number $a$ so that:
a) $\Big ((a^2-3)^3+1\Big) ^a-1$ is a perfect square?
b) $\Big ((a^2-3)^3+1\Big) ^{a+1}-1$ is a perfect square?
Prove that if an integer $n$ is of the form $4m+3$, where $m$ is another integer, then $n$ is not a sum of two perfect squares (a perfect square is an integer which is the square of some integer).
Prove that there exists two strictly increasing sequences $(a_{n})$ and $(b_{n})$ such that $a_{n}(a_{n}+1)$ divides $b^{2}_{n}+1$ for every natural n.
Consider the sequence $(a^n + 1)_{n\geq 1}$, with $a>1$ a fixed integer.
i) Prove there exist infinitely many primes, each dividing some term of the sequence.
ii) Prove there exist infinitely many primes, none dividing any term of the sequence.
[i](Dan Schwarz)[/i]
How many integers $0\leq x < 121$ are there such that $x^5+5x^2 + x + 1 \equiv 0 \pmod{121}$?
$
\textbf{(A)}\ 0
\qquad\textbf{(B)}\ 1
\qquad\textbf{(C)}\ 2
\qquad\textbf{(D)}\ 4
\qquad\textbf{(E)}\ 5
$
Four positive integers $x,y,z$ and $t$ satisfy the relations
\[ xy - zt = x + y = z + t. \]
Is it possible that both $xy$ and $zt$ are perfect squares?
Let $a$ be a fixed positive integer and $(e_n)$ the sequence, which is defined by $e_0=1$ and
$$ e_n=a + \prod_{k=0}^{n-1} e_k$$
for $n \geq 1$.
Prove that
(a) There exist infinitely many prime numbers that divide one element of the sequence.
(b) There exists one prime number that does not divide an element of the sequence.
(Theresia Eisenkölbl)
Find all positive integers $n$ such that for any integer $k$ there exists an integer $a$ for which $a^3+a-k$ is divisible by $n$.
[i]Warut Suksompong, Thailand[/i]
For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$
(a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$
(b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$
[I]United Kingdom[/i]
Find all positive integer pairs $(a,b)$ such that, $$\frac{10^{a!} - 3^b +1}{2^a}$$ is a perfect square.
Prove that there are infinitely many distinct pairs $(a, b)$ of relatively prime integers $a>1$ and $b>1$ such that $a^b+b^a$ is divisible by $a+b$.