Found problems: 364
The sequence $a_0$, $a_1$, $a_2,$ $\ldots$ is defined as follows: \[a_0=2, \qquad a_{k+1}=2a_k^2-1 \quad\text{for }k \geq 0.\] Prove that if an odd prime $p$ divides $a_n$, then $2^{n+3}$ divides $p^2-1$.
[hide="comment"]
Hi guys ,
Here is a nice problem:
Let be given a sequence $a_n$ such that $a_0=2$ and $a_{n+1}=2a_n^2-1$ . Show that if $p$ is an odd prime such that $p|a_n$ then we have $p^2\equiv 1\pmod{2^{n+3}}$
Here are some futher question proposed by me :Prove or disprove that :
1) $gcd(n,a_n)=1$
2) for every odd prime number $p$ we have $a_m\equiv \pm 1\pmod{p}$ where $m=\frac{p^2-1}{2^k}$ where $k=1$ or $2$
Thanks kiu si u
[i]Edited by Orl.[/i]
[/hide]
Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ for which these two conditions hold simultaneously
(i) For all $m,n \in \mathbb{N}$ we have:
$$ \frac{f(mn)}{\gcd(m,n)} = \frac{f(m)f(n)}{f(\gcd(m,n))};$$
(ii) For all prime numbers $p$, there exists a prime number $q$ such that $f(p^{2025})=q^{2025}$.
$p > 3$ is a prime number such that $p|2^{p-1} - 1$ and $p \nmid 2^x - 1$ for $x = 1, 2,...,p-2$. Let $p = 2k + 3$. Now we define sequence $\{a_n\}$ as $$a_i = a_{i+k} = 2^i \,\, (1 \le i \le k ), \,\,\,\, a_{j+2k} = a_ja_{j+k} \,\, (j \le 1)$$
Prove that there exist $2k$ consecutive terms of sequence $a_{x+1},a_{x+2},..., a_{x+2k}$ such that $a_{x+i } \not\equiv a_{x+j}$ (mod $p$) for all $1 \le i < j \le 2k$ .
A composite natural number $n$ is called [i]happy [/i] if at most one of the numbers $2^{2^n}+ 1$ and $6^{2^n}+ 1$ is prime. Show that there are infinitely many happy numbers.
For arbitrary positive integers $a, b$, denote $a @ b =\frac{a-b}{gcd(a,b)}$
Let $n$ be a positive integer. Prove that the following conditions are equivalent:
(i) $gcd(n, n @ m) = 1$ for every positive integer $m < n$,
(ii) $n = p^k$ where $p$ is a prime number and $k$ is a non-negative integer.
Find all primes that can be written both as a sum of two primes and as a difference of two primes.
Find all pairs $(p,q)$ of prime numbers such that
$$ p(p^2 - p - 1) = q(2q + 3) .$$
Find all prime numbers $p$ for which $p^2 +11$ has exactly six positive divisors.
A natural number is called a [i]prime power[/i] if that number can be expressed as $p^n$ for some prime $p$ and natural number $n$.
Determine the largest possible $n$ such that there exists a sequence of prime powers $a_1, a_2, \dots, a_n$ such that $a_i = a_{i - 1} + a_{i - 2}$ for all $3 \le i \le n$.
Denote $S$ as the set of prime divisors of all integers of form $2^{n^2+1} - 3^n, n \in Z^+$.
Prove that $S$ and $P-S$ both contain infinitely many elements (where $P$ is set of prime numbers).
Let $p$ and $q$ be different primes, and $\alpha\in (0, 3)$ a real number. Prove that in sequence
$$\left[ \alpha \right] , \left[ 2\alpha \right] , \left[ 3\alpha \right] \dots$$
exists number less than $2pq$, divisible by $p$ or $q$.
Find all primes $p$, such that there exist positive integers $x$, $y$ which satisfy
$$\begin{cases}
p + 49 = 2x^2\\
p^2 + 49 = 2y^2\\
\end{cases}$$
Determine the smallest prime that does not divide any five-digit number whose digits are in a strictly increasing order.
Let $ p$ be an odd prime number. How many $ p$-element subsets $ A$ of $ \{1,2,\dots,2p\}$ are there, the sum of whose elements is divisible by $ p$?
Determine the integers $n$ where $$|2n^2+9n+4|$$ is a prime number.
Find all positive integers $n>2$ such that
$$ n! \mid \prod_{ p<q\le n, p,q \, \text{primes}} (p+q)$$
Prove that for all primes \( p \) such that \( p \equiv 3 \pmod{4} \) or \( p \equiv 5 \pmod{8} \), there exist integers
\[
1 \leq a_1 < a_2 < \cdots < a_{(p-1)/2} < p
\]
such that
\[
\prod_{\substack{1 \leq i < j \leq (p-1)/2}} (a_i + a_j)^2 \equiv 1 \pmod{p}.
\]
Professor Moriarty has designed a “prime-testing trail.” The trail has $2002$ stations, labeled $1,... , 2002$.
Each station is colored either red or green, and contains a table which indicates, for each of the digits $0, ..., 9$, another station number. A student is given a positive integer $n$, and then walks along the trail, starting at station $1$. The student reads the first (leftmost) digit of $n,$ and looks this digit up in station $1$’s table to get a new station location. The student then walks to this new station, reads the second digit of $n$ and looks it up in this station’s table to get yet another station location, and so on, until the last (rightmost) digit of $n$ has been read and looked up, sending the student to his or her final station. Here is an example that shows possible values for some of the tables. Suppose that $n = 19$:
[img]https://cdn.artofproblemsolving.com/attachments/f/3/db47f6761ca1f350e39d53407a1250c92c4b05.png[/img]
Using these tables, station $1$, digit $1$ leads to station $29$m station $29$, digit $9$ leads to station $1429$, and
station $1429$ is green.
Professor Moriarty claims that for any positive integer $n$, the final station (in the example, $1429$) will be green if and only if $n$ is prime. Is this possible?
Determine all positive integer $a$ such that the equation $2x^2 - 30x + a = 0$ has two prime roots, i.e. both roots are prime numbers.
Does there exist a sequence of $2017$ consecutive integers which contains exactly $17$ primes?
Show that there is no infinite sequence of primes $p_1, p_2, p_3, . . .$ there any for each $ k$: $p_{k+1} = 2p_k - 1$ or $p_{k+1} = 2p_k + 1$ is fulfilled.
Note that not the same formula for every $k$.
Let $n$ be a natural number and $p_1, ..., p_n$ distinct prime numbers. Show that
$$p_1^2 + p_2^2 + ... + p_n^2 > n^3$$
How many integers $n$ are there such that $n^4 + 2n^3 + 2n^2 + 2n + 1$ is a prime number?
Let $a$, $b$, $c$, $d$, $e$, $f$ and $g$ be seven distinct positive integers not bigger than $7$. Find all primes which can be expressed as $abcd+efg$
How many of the first ten numbers of the sequence $121$, $11211$, $1112111$, ... are prime numbers?
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$