Found problems: 1048
Let $p$ be a prime number. For any $\sigma \in S_p$ (the permutation group of $\{1,2,...,p \}),$ define the matrix $A_{\sigma}=(a_{ij}) \in \mathcal{M}_p(\mathbb{Z})$ as $a_{ij} = \sigma^{i-1}(j),$ where $\sigma^0$ is the identity permutation and $\sigma^k = \underbrace{\sigma \circ \sigma \circ ... \circ \sigma}_k.$
Prove that $D = \{ |\det A_{\sigma}| : \sigma \in S_p \}$ has at most $1+ (p-2)!$ elements.
Show that every set $ \{p_1,p_2,\dots,p_k\}$ of prime numbers fulfils the following: The sum of all unit fractions (that are fractions of the type $ \frac{1}{n}$), whose denominators are exactly the $ k$ given prime factors (but in arbitrary powers with exponents unequal zero), is an unit fraction again.
How big is this sum if $ \frac{1}{2004}$ is among this summands?
Show that for every set $ \{p_1,p_2,\dots,p_k\}$ containing $ k$ prime numbers ($ k>2$) is the sum smaller than $ \frac{1}{N}$ with $ N=2\cdot 3^{k-2}(k-2)!$
Find all prime numbers that do not have a multiple ending in $2015$.
Let $p$ be a prime number. Find all the positive integers $n$ such that $p+n$ divides $pn$
A positive integer is called [i]cool[/i] if it can be expressed in the form $a!\cdot b!+315$ where $a,b$ are positive integers. For example, $1!\cdot 1!+315=316$ is a cool number. Find the sum of all cool numbers that are also prime numbers.
[i]Proposed by Evan Fang
Show that there exists an increasing sequence $a_1,a_2,a_3,...$ of natural numbers such that, for any integer $k \ge 2$, the sequence $k+a_n$ ($n \in N$) contains only finitely many primes.
Positive integers $k, m, n ,p $ integers are such that $p=2^{2^n}+1$ is prime and $p\mid 2^k-m$. Prove that there exists a positive integer $l$ such that $p^2\mid 2^l-m$.
Determine the least possible value of $f(1998),$ where $f:\Bbb{N}\to \Bbb{N}$ is a function such that for all $m,n\in {\Bbb N}$,
\[f\left( n^{2}f(m)\right) =m\left( f(n)\right) ^{2}. \]
Let a, b, c, d, and e be positive integers. Are there any solutions to $a^2+b^3+c^5+d^7=e^{11}$?
Let $p>5$ be a prime number and $A=\{b_1,b_2,\dots,b_{\frac{p-1}{2}}\}$ be the set of all quadratic residues modulo $p$, excluding zero. Prove that there doesn't exist any natural $a,c$ satisfying $(ac,p)=1$ such that set $B=\{ab_1+c,ab_2+c,\dots,ab_{\frac{p-1}{2}}+c\}$ and set $A$ are disjoint modulo $p$.
[i]This problem was proposed by Amir Hossein Pooya.[/i]
We are given a polynomial $f(x)=x^6-11x^4+36x^2-36$. Prove that for an arbitrary prime number $p$, $f(x)\equiv 0\pmod{p}$ has a solution.
Prove that there are infinitely many positive integers $k$ such that $k(k+1)(k+2)(k+3)$ has no prime divisor of the form $8t+5.$
The first $510$ positive integers are written on a blackboard: $1, 2, 3, ..., 510$. An [i]operation [/i] consists of of erasing two numbers whose sum is a prime number. What is the maximum number of operations in a row what can be done? Show how it is accomplished and explain why it can be done in no more operations.
2017 prime numbers $p_1,...,p_{2017}$ are given. Prove that $\prod_{i<j} (p_i^{p_j}-p_j^{p_i})$ is divisible by 5777.
Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$.
Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.
For an arbitrary prime number $p$, show that there exists infinitely many multiples of $p$ that can be expressed as the form $$\frac{x^2+y+1}{x+y^2+1}$$ Where $x, y$ are some positive integers.
Let $f(x)$ be a monic polynomial of degree $2023$ with positive integer coefficients.
Show that for any sufficiently large integer $N$ and any prime number $p>2023N$, the product
\[f(1)f(2)\dots f(N)\]
is at most $\binom{2023}{2}$ times divisible by $p$.
[i]Proposed by Ashwin Sah[/i]
Given a prime number $p > 2$. Find the least $n\in Z_+$, for which every set of $n$ perfect squares not divisible by $p$ contains nonempty subset with product of all it's elements equal to $1\ (\text{mod}\ p)$
Let $p{}$ be a prime number. Prove that the equation has $x^2-x+3-ps=0$ with $x,s\in\mathbb{Z}$ has solutions if and only if the equation $y^2-y+25-pt=0$ with $y,t\in\mathbb{Z}$ has solutions.
Given a chessboard $n \times n$, where $n\geq 4$ and $p=n+1$ is a prime number. A set of $n$ unit squares is called [i]tactical[/i] if after putting down queens on these squares, no two queens are attacking each other. Prove that there exists a partition of the chessboard into $n-2$ tactical sets, not containing squares on the main diagonals.
Queens are allowed to move horizontally, vertically and diagonally.
Find all integes $a,b,c,d$ that form an arithmetic progression satisfying $d-c+1$ is prime number and $a+b^2+c^3=d^2b$
Find all triples $(a,b,c)$ satisfying the following conditions:
(i) $a,b,c$ are prime numbers, where $a<b<c<100$.
(ii) $a+1,b+1,c+1$ form a geometric sequence.
Let $n$ be a nonnegative integer, and let $p$ be a prime number that is congruent to $7$ modulo $8$. Prove that
$$\sum_{k=1}^{p} \left\{ \frac{k^{2n}}{p} - \frac{1}{2} \right\} = \frac{p-1}{2}$$
Let $P$ be the set of prime numbers. Consider a subset $M$ of $P$ with at least three elements. We assume that, for each non empty and finite subset $A$ of $M$, with $A \neq M$, the prime divisors of the integer $( \prod_{p \in A} ) - 1$ belong to $M$.
Prove that $M = P$.
For which non-negative integers $n$ is \[K=5^{2n+3} + 3^{n+3} \cdot 2^n\] prime?