Found problems: 341
Prove that $ 7^{2^{20}} + 7^{2^{19}} + 1 $ has at least $ 21 $ distinct prime divisors.
Each rational number is painted either white or red. Call such a coloring of the rationals [i]sanferminera[/i] if for any distinct rationals numbers $x$ and $y$ satisfying one of the following three conditions: [list=1][*]$xy=1$,
[*]$x+y=0$,
[*]$x+y=1$,[/list]we have $x$ and $y$ painted different colors. How many sanferminera colorings are there?
A two-digit positive integer is said to be [i]cuddly[/i] if it is equal to the sum of its nonzero tens digit and the square of its units digit. How many two-digit positive integers are cuddly?
$\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }4$
A set of positive integers is called [i]fragrant[/i] if it contains at least two elements and each of its elements has a prime factor in common with at least one of the other elements. Let $P(n)=n^2+n+1$. What is the least possible positive integer value of $b$ such that there exists a non-negative integer $a$ for which the set $$\{P(a+1),P(a+2),\ldots,P(a+b)\}$$ is fragrant?
We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n},\] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof.
Prove that $F_{n-1}F_{n}F_{n+1}L_{n-1}L_{n}L_{n+1}(n \geq 2)$ is not a perfect square.
Let $\tau(n)$ be the number of positive divisors of $n$. Let $\tau_1(n)$ be the number of positive divisors of $n$ which have remainders $1$ when divided by $3$. Find all positive integral values of the fraction $\frac{\tau(10n)}{\tau_1(10n)}$.
Let $\nu$ be an irrational positive number, and let $m$ be a positive integer. A pair of $(a,b)$ of positive integers is called [i]good[/i] if
\[a \left \lceil b\nu \right \rceil - b \left \lfloor a \nu \right \rfloor = m.\] A good pair $(a,b)$ is called [i]excellent[/i] if neither of the pair $(a-b,b)$ and $(a,b-a)$ is good.
Prove that the number of excellent pairs is equal to the sum of the positive divisors of $m$.
For two positive integers a and b, which are relatively prime, find all integer that can be the great common divisor of $a+b$ and $\frac{a^{2005}+b^{2005}}{a+b}$.
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
Compute $\sum^{999}_{x=1}\gcd (x, 10x + 9)$.
Find all positive integers n with the following property: For every positive divisor $d$ of $n$, $d+1$ divides $n+1$.
Prove that if the sum of two irreducible fractions is an integer then the two fractions have the same denominator.
Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers.
One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins).
In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice.
[i]Nikolai Beluhov[/i]
Find all positive integers $n < 10^{100}$ for which simultaneously $n$ divides $2^n$, $n-1$ divides $2^n - 1$, and $n-2$ divides $2^n - 2$.
Suppose $a_1, \dots, a_n$ are integers whose greatest common divisor is 1. Let $S$ be a set of integers with the following properties:
(a) For $i=1, \dots, n$, $a_i \in S$.
(b) For $i,j = 1, \dots, n$ (not necessarily distinct), $a_i - a_j \in S$.
(c) For any integers $x,y \in S$, if $x+y \in S$, then $x-y \in S$.
Prove that $S$ must be equal to the set of all integers.
Find all positive integer pairs $(a,n)$ such that $\frac{(a+1)^n-a^n}{n}$ is an integer.
Call a finite set of positive integers [i]independent [/i] if its elements are pairwise coprime, and [i]nice [/i] if the arithmetic mean of the elements of every non-empty subset of it is an integer.
a) Prove that for any positive integer $n$ there is an $n$-element set of positive integers which is both independent and nice.
b) Is there an infinite set of positive integers whose every independent subset is nice and which has an $n$-element independent subset for every positive integer $n$?
A [i]lattice point[/i] in the Cartesian plane is a point whose coordinates are both integers. A [i]lattice polygon[/i] is a polygon all of whose vertices are lattice points.
Let $\Gamma$ be a convex lattice polygon. Prove that $\Gamma$ is contained in a convex lattice polygon $\Omega$ such that the vertices of $\Gamma$ all lie on the boundary of $\Omega$, and exactly one vertex of $\Omega$ is not a vertex of $\Gamma$.
Let $S = \mathbb Z \times \mathbb Z$. A subset $P$ of $S$ is called [i]nice[/i] if
[list]
[*] $(a, b) \in P \implies (b, a) \in P$
[*] $(a, b)$, $(c, d)\in P \implies (a + c, b - d) \in P$
[/list]
Find all $(p, q) \in S$ so that if $(p, q) \in P$ for some [i]nice[/i] set $P$ then $P = S$.
For each integer $n \geq 2$, let $F(n)$ denote the greatest prime factor of $n$. A [i]strange pair[/i] is a pair of distinct primes $p$ and $q$ such that there is no integer $n \geq 2$ for which $F(n)F(n+1)=pq$.
Prove that there exist infinitely many strange pairs.
Let $\mathbb{Z}[x]$ denote the set of single-variable polynomials in $x$ with integer coefficients. Find all functions $\theta : \mathbb{Z}[x] \to \mathbb{Z}[x]$ (i.e. functions taking polynomials to polynomials)
such that
[list]
[*] for any polynomials $p, q \in \mathbb{Z}[x]$, $\theta(p + q) = \theta(p) + \theta(q)$;
[*] for any polynomial $p \in \mathbb{Z}[x]$, $p$ has an integer root if and only if $\theta(p)$ does.
[/list]
[i]Carl Schildkraut[/i]
Find the smallest positive integer $n$ for which $315^2-n^2$ evenly divides $315^3-n^3$.
[i]Proposed by Kyle Lee[/i]
Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.
For all integers $x$ and $y$, let $a_{x, y}$ be a real number. Suppose that $a_{0, 0} = 0$. Suppose that only a finite number of the $a_{x, y}$ are nonzero. Prove that
\[
\sum_{x = -\infty}^\infty \sum_{y = -\infty}^{\infty} a_{x,y} ( a_{x, 2x + y} + a_{x + 2y, y} )
\le \sqrt{3} \sum_{x = -\infty}^\infty \sum_{y = -\infty}^{\infty} a_{x, y}^2 \, .
\]
Let $f : \{ 1, 2, 3, \dots \} \to \{ 2, 3, \dots \}$ be a function such that $f(m + n) | f(m) + f(n) $ for all pairs $m,n$ of positive integers. Prove that there exists a positive integer $c > 1$ which divides all values of $f$.