Found problems: 700
Determine the primes $p$ for which the numbers $2\lfloor p/k\rfloor - 1, \ k = 1,2,\ldots, p,$ are all quadratic residues modulo $p.$
[i]Vlad Matei[/i]
Find all integers $n=2k+1>1$ so that there exists a permutation $a_0, a_1,\ldots,a_{k}$ of $0, 1, \ldots, k$ such that
\[a_1^2-a_0^2\equiv a_2^2-a_1^2\equiv \cdots\equiv a_{k}^2-a_{k-1}^2\pmod n.\]
[i]Proposed by usjl[/i]
Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \]
cannot be divided by $5$.
For a positive integer $a$, define a sequence of integers $x_1,x_2,\ldots$ by letting $x_1=a$ and $x_{n+1}=2x_n+1$ for $n\geq 1$. Let $y_n=2^{x_n}-1$. Determine the largest possible $k$ such that, for some positive integer $a$, the numbers $y_1,\ldots,y_k$ are all prime.
Find the greatest common divisor of all numbers of the form $(2^{a^2}\cdot 19^{b^2} \cdot 53^{c^2} + 8)^{16} - 1$ where $a,b,c$ are integers.
Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$
[list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good.
[*][b](b)[/b] Show that all 2010-good pairs are very good.[/list]
[i]Proposed by Okan Tekman, Turkey[/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]
Find all pairs of positive integers $m$, $n$ such that the $(m+n)$-digit number \[\underbrace{33\ldots3}_{m}\underbrace{66\ldots 6}_{n}\] is a perfect square.
(a) Find all positive integers $ n$ for which $ 2^n\minus{}1$ is divisible by $ 7$.
(b) Prove that there is no positive integer $ n$ for which $ 2^n\plus{}1$ is divisible by $ 7$.
Amy and Bob play the game. At the beginning, Amy writes down a positive integer on the board. Then the players take moves in turn, Bob moves first. On any move of his, Bob replaces the number $n$ on the blackboard with a number of the form $n-a^2$, where $a$ is a positive integer. On any move of hers, Amy replaces the number $n$ on the blackboard with a number of the form $n^k$, where $k$ is a positive integer. Bob wins if the number on the board becomes zero.
Can Amy prevent Bob’s win?
[i]Maxim Didin, Russia[/i]
Let $\displaystyle \mathcal K$ be a finite field such that the polynomial $\displaystyle X^2-5$ is irreducible over $\displaystyle \mathcal K$. Prove that:
(a) $1+1 \neq 0$;
(b) for all $\displaystyle a \in \mathcal K$, the polynomial $\displaystyle X^5+a$ is reducible over $\displaystyle \mathcal K$.
[i]Marian Andronache[/i]
[Edit $1^\circ$] I wanted to post it in "Superior Algebra - Groups, Fields, Rings, Ideals", but I accidentally put it here :blush: Can any mod move it? I'd be very grateful.
[Edit $2^\circ$] OK, thanks.
Show that if $m$ and $n$ are relatively prime positive integers, then $\phi( 5^m -1) \neq 5^{n}-1$.
Let $A$ be the set of positive integers of the form $a^2 +2b^2$, where $a$ and $b$ are integers and $b \neq 0$. Show that if $p$ is a prime number and $p^2 \in A$, then $p \in A$.
Does there exist a strictly increasing infinite sequence of perfect squares $a_1, a_2, a_3, ...$ such that for all $k\in \mathbb{Z}^+$ we have that $13^k | a_k+1$?
[i]Proposed by Jesse Zhang[/i]
Prove that if $n$ is a natural number such that both $3n+1$ and $4n+1$ are squares, then $n$ is divisible by $56$.
Determine all quadruples $(x,y,z,t)$ of positive integers such that
\[ 20^x + 14^{2y} = (x + 2y + z)^{zt}.\]
Call a pair of integers $a$ and $b$ square makers , if $ab+1$ is a perfect square.
Determine for which $n$ is it possible to divide the set $\{1,2, \dots , 2n\}$ into $n$ pairs of square makers.
Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that:
[b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color,
and
[b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$.
[i]Author: Gerhard Wöginger, Netherlands[/i]
Lenth of a right angle triangle sides are posive integer. Prove that double area of the triangle divides 12.
On a blackboard, there are $17$ integers not divisible by $17$. Alice and Bob play a game.
Alice starts and they alternately play the following moves:
$\bullet$ Alice chooses a number $a$ on the blackboard and replaces it with $a^2$
$\bullet$ Bob chooses a number $b$ on the blackboard and replaces it with $b^3$.
Alice wins if the sum of the numbers on the blackboard is a multiple of $17$ after a finite number of steps.
Prove that Alice has a winning strategy.
(Daniel Holmes)
How many integer triples $(x,y,z)$ are there such that \[\begin{array}{rcl} x - yz^2&\equiv & 1 \pmod {13} \\ xz+y&\equiv& 4 \pmod {13} \end{array}\] where $0\leq x < 13$, $0\leq y <13$, and $0\leq z< 13$?
$
\textbf{(A)}\ 10
\qquad\textbf{(B)}\ 23
\qquad\textbf{(C)}\ 36
\qquad\textbf{(D)}\ 49
\qquad\textbf{(E)}\ \text{None of above}
$
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]
Let $p$ be a prime number such that $p\equiv 1\pmod{4}$. Determine $\sum_{k=1}^{\frac{p-1}{2}}\left \lbrace \frac{k^2}{p} \right \rbrace$, where $\{x\}=x-[x]$.
Let $p$ be an odd prime number and $\mathbb{Z}_{>0}$ be the set of positive integers. Suppose that a function $f:\mathbb{Z}_{>0}\times\mathbb{Z}_{>0}\to\{0,1\}$ satisfies the following properties:
[list]
[*] $f(1,1)=0$.
[*] $f(a,b)+f(b,a)=1$ for any pair of relatively prime positive integers $(a,b)$ not both equal to 1;
[*] $f(a+b,b)=f(a,b)$ for any pair of relatively prime positive integers $(a,b)$.
[/list]
Prove that
$$\sum_{n=1}^{p-1}f(n^2,p) \geqslant \sqrt{2p}-2.$$
Prime number $p>3$ is congruent to $2$ modulo $3$. Let $a_k = k^2 + k +1$ for $k=1, 2, \ldots, p-1$. Prove that product $a_1a_2\ldots a_{p-1}$ is congruent to $3$ modulo $p$.