Found problems: 700
Let $p>7$ be a prime and let $A$ be subset of $\{0,1, \ldots, p-1\}$ with size at least $\frac{p-1}{2}$. Show that for each integer $r$, there exist $a, b, c, d \in A$, not necessarily distinct, such that $ab-cd \equiv r \pmod p$.
Let $A$ be a subset of $\{2,3, \ldots, 28 \}$ such that if $a \in A$, then the residue obtained when we divide $a^2$ by $29$ also belongs to $A$.
Find the minimum possible value of $|A|$.
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]
If $m=2+2\sqrt{44n^2+1}$ is an integer then show that it is also a perfect square. Here $n$ is a natural number.
For a prime $p$, a subset $S$ of residues modulo $p$ is called a [i]sum-free multiplicative subgroup[/i] of $\mathbb F_p$ if
$\bullet$ there is a nonzero residue $\alpha$ modulo $p$ such that $S = \left\{ 1, \alpha^1, \alpha^2, \dots \right\}$ (all considered mod $p$), and
$\bullet$ there are no $a,b,c \in S$ (not necessarily distinct) such that $a+b \equiv c \pmod p$.
Prove that for every integer $N$, there is a prime $p$ and a sum-free multiplicative subgroup $S$ of $\mathbb F_p$ such that $\left\lvert S \right\rvert \ge N$.
[i]Proposed by Noga Alon and Jean Bourgain[/i]
Find all positive integers $n$ such that $\varphi(n)$ divides $n^2 + 3$.
Are there positive integers $a$, $b$, $c$ and $d$ such that:
a) $a^{2021} + b^{2023} = 11(c^{2022} + d^{2024})$;
b) $a^{2022} + b^{2022} = 11(c^{2022} + d^{2022})$?
a) Find two sets $X,Y$ such that $X\cap Y =\emptyset$, $X\cup Y = \mathbb Q^{\star}_{+}$ and $Y = \{a\cdot b \mid a,b \in X \}$.
b) Find two sets $U,V$ such that $U\cap V =\emptyset$, $U\cup V = \mathbb R$ and $V = \{x+y \mid x,y \in U \}$.
Suppose $p$ is a prime with $p \equiv 3 \; \pmod{4}$. Show that for any set of $p-1$ consecutive integers, the set cannot be divided two subsets so that the product of the members of the one set is equal to the product of the members of the other set.
Let $p \neq 13$ be a prime number of the form $8k+5$ such that $39$ is a quadratic non-residue modulo $p$. Prove that the equation $$x_1^4+x_2^4+x_3^4+x_4^4 \equiv 0 \pmod p$$ has a solution in integers such that $p\nmid x_1x_2x_3x_4$.
Find all triples $(m,p,q)$ where $ m $ is a positive integer and $ p , q $ are primes.
\[ 2^m p^2 + 1 = q^5 \]
Let $p>5$ be a prime number. For any integer $x$, define
\[{f_p}(x) = \sum_{k=1}^{p-1} \frac{1}{(px+k)^2}\]
Prove that for any pair of positive integers $x$, $y$, the numerator of $f_p(x) - f_p(y)$, when written as a fraction in lowest terms, is divisible by $p^3$.
Let $ \mathbb{Z}$ denote the set of all integers. Prove that for any integers $ A$ and $ B,$ one can find an integer $ C$ for which $ M_1 \equal{} \{x^2 \plus{} Ax \plus{} B : x \in \mathbb{Z}\}$ and $ M_2 \equal{} {2x^2 \plus{} 2x \plus{} C : x \in \mathbb{Z}}$ do not intersect.
Find all primes $p$ such that the expression
\[\binom{p}1^2+\binom{p}2^2+\cdots+\binom{p}{p-1}^2\]
is divisible by $p^3$.
Take a sequence $(a_n)_{n=1}^\infty$ such that
$a_1=3$
$a_n=a_1a_2a_3...a_{n-1}-1$
[b]a)[/b] Prove that there exists infitely many primes that divides at least 1 term of the sequence.
[b]b)[/b] Prove that there exists infitely many primes that doesn't divide any term of the sequence.
Let $p$ be a prime. It is given that there exists a unique nonconstant function $\chi:\{1,2,\ldots, p-1\}\to\{-1,1\}$ such that $\chi(1) = 1$ and $\chi(mn) = \chi(m)\chi(n)$ for all $m, n \not\equiv 0 \pmod p$ (here the product $mn$ is taken mod $p$). For how many positive primes $p$ less than $100$ is it true that \[\sum_{a=1}^{p-1}a^{\chi(a)}\equiv 0\pmod p?\] Here as usual $a^{-1}$ denotes multiplicative inverse.
[i]Proposed by David Altizio[/i]
Given a prime $ p = 8k+1 $ for some integer $ k $. Let $ r $ be the remainder when $ \binom{4k}{k} $ is divided by $ p $. Prove that $ \sqrt{r} $ is not an integer.
[i]Proposed by Evan Chen[/i]
Let $p$ be an odd prime number such that $p\equiv 2\pmod{3}.$ Define a permutation $\pi$ of the residue classes modulo $p$ by $\pi(x)\equiv x^3\pmod{p}.$ Show that $\pi$ is an even permutation if and only if $p\equiv 3\pmod{4}.$
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]
For a prime $q$, let $\Phi_q(x)=x^{q-1}+x^{q-2}+\cdots+x+1$.
Find the sum of all primes $p$ such that $3 \le p \le 100$ and there exists an odd prime $q$ and a positive integer $N$ satisfying
\[\dbinom{N}{\Phi_q(p)}\equiv \dbinom{2\Phi_q(p)}{N} \not \equiv 0 \pmod p. \][i]Proposed by Sammy Luo[/i]
Let $p=4k+1$ be a prime. $S$ is a set of all possible residues equal or smaller then $2k$ when $\frac{1}{2} \binom{2k}{k} n^k$ is divided by $p$. Show that \[ \sum_{x \in S} x^2 =p \]
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$
In the table $n \times n$ numbers from $1$ to $n$ are written in a spiral way. For which $n$ all the numbers on the main diagonal are distinct?
Find all integers $a$ such that there is a prime number of $p\ge 5$ that divides
${p-1 \choose 2}$ $+ {p-1 \choose 3} a$ $+{p-1 \choose 4} a^2$+ ...+$ {p-1 \choose p-3} a^{p-5} .$
Show that the equation \(a^3+(a+1)^3+\ldots+(a+6)^3=b^4+(b+1)^4\) has no solutions in integers \(a,b\).