Found problems: 526
A teacher was leading a class of four perfectly logical students. The teacher chose a set $S$ of four integers and gave a different number in $S$ to each student. Then the teacher announced to the class that the numbers in $S$ were four consecutive two-digit positive integers, that some number in $S$ was divisible by $6$, and a different number in $S$ was divisible by $7$. The teacher then asked if any of the students could deduce what $S$ is, but in unison, all of the students replied no.
However, upon hearing that all four students replied no, each student was able to determine the elements of $S$. Find the sum of all possible values of the greatest element of $S$.
If $n$ is a natural number, prove that the number $(n+1)(n+2)\cdots(n+10)$ is not a perfect square.
Let $ n$ be a positive integer and let $ a_1,a_2,a_3,\ldots,a_k$ $ ( k\ge 2)$ be distinct integers in the set $ { 1,2,\ldots,n}$ such that $ n$ divides $ a_i(a_{i + 1} - 1)$ for $ i = 1,2,\ldots,k - 1$. Prove that $ n$ does not divide $ a_k(a_1 - 1).$
[i]Proposed by Ross Atkins, Australia [/i]
Prove that for any integer $n$, there exists a unique polynomial $Q$ with coefficients in $\{0,1,\ldots,9\}$ such that $Q(-2) = Q(-5) = n$.
Find all $ a, b, c \in \mathbb{Z} $, $ c \ge 0 $ such that $ a^n + 2^n | b^n + c $ for all positive integers $ n $ where $ 2ab $ is non-square.
Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$
[i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]
$\mathbb{N}_{10}$ is generalization of $\mathbb{N}$ that every hypernumber in $\mathbb{N}_{10}$ is something like: $\overline{...a_2a_1a_0}$ with $a_i \in {0,1..9}$
(Notice that $\overline {...000} \in \mathbb{N}_{10}$)
Also we easily have $+,*$ in $\mathbb{N}_{10}$.
first $k$ number of $a*b$= first $k$ nubmer of (first $k$ number of a * first $k$ number of b)
first $k$ number of $a+b$= first $k$ nubmer of (first $k$ number of a + first $k$ number of b)
Fore example $\overline {...999}+ \overline {...0001}= \overline {...000}$
Prove that every monic polynomial in $\mathbb{N}_{10}[x]$ with degree $d$ has at most $d^2$ roots.
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 every integer $m\ge 1$, let $\mathbb{Z}/m\mathbb{Z}$ denote the set of integers modulo $m$. Let $p$ be a fixed prime and let $a\ge 2$ and $e\ge 1$ be fixed integers. Given a function $f\colon \mathbb{Z}/a\mathbb{Z}\to \mathbb{Z}/p^e\mathbb{Z}$ and an integer $k\ge 0$, the $k$[i]th finite difference[/i], denoted $\Delta^k f$, is the function from $\mathbb{Z}/a\mathbb{Z}$ to $\mathbb{Z}/p^e\mathbb{Z}$ defined recursively by
\begin{align*}
\Delta^0 f(n)&=f(n)\\
\Delta^k f(n)&=\Delta^{k-1}f(n+1)-\Delta^{k-1}f(n) & \text{for } k=1,2,\dots.
\end{align*}
Determine the number of functions $f$ such that there exists some $k\ge 1$ for which $\Delta^kf=f$.
[i]Holden Mui[/i]
Find the last three digits of
\[2008^{2007^{\cdot^{\cdot^{\cdot ^{2^1}}}}}.\]
Let $S$ be the sum of all positive integers that can be expressed in the form $2^a \cdot 3^b \cdot 5^c$, where $a$, $b$, $c$ are positive integers that satisfy $a+b+c=10$. Find the remainder when $S$ is divided by $1001$.
[i]Proposed by Michael Ren[/i]
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 $n$ a positive integer, let $R(n)$ be the sum of the remainders when $n$ is divided by $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, and $10$. For example, $R(15) = 1+0+3+0+3+1+7+6+5=26$. How many two-digit positive integers $n$ satisfy $R(n) = R(n+1)\,?$
$\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }4$
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]
a.) A 7-tuple $(a_1,a_2,a_3,a_4,b_1,b_2,b_3)$ of pairwise distinct positive integers with no common factor is called a shy tuple if $$ a_1^2+a_2^2+a_3^2+a_4^2=b_1^2+b_2^2+b_3^2$$and for all $1 \le i<j \le 4$ and $1 \le k \le 3$, $a_i^2+a_j^2 \not= b_k^2$. Prove that there exists infinitely many shy tuples.
b.) Show that $2016$ can be written as a sum of squares of four distinct natural numbers.
Determine all positive integers that cannot be written as $\frac{a}{b} + \frac{a+1}{b+1}$ where $a$ and $b$ are positive integers.
[b]p1.[/b] Find the smallest positive integer which is $1$ more than multiple of $3$, $2$ more than a multiple of $4$, and $4$ more than a multiple of $7$.
[b]p2.[/b] Let $p = 4$, and let $a =\sqrt1$, $b =\sqrt2$, $c =\sqrt3$, $...$. Compute the value of $(p-a)(p-b) ... (p-z)$.
[b]p3.[/b] There are $6$ points on the circumference of a circle. How many convex polygons are there having vertices on these points?
[b]p4.[/b] David and I each have a sheet of computer paper, mine evenly spaced by $19$ parallel lines into $20$ sections, and his evenly spaced by $29$ parallel lines into $30$ sections. If our two sheets are overlayed, how many pairs of lines are perfectly incident?
[b]p5.[/b] A pyramid is created by stacking equilateral triangles of balls, each layer having one fewer ball per side than the triangle immediately beneath it. How many balls are used if the pyramid’s base has $5$ balls to a side?
[b]p6.[/b] Call a positive integer $n$ good if it has $3$ digits which add to $4$ and if it can be written in the form $n = k^2$, where $k$ is also a positive integer. Compute the average of all good numbers.
[b]p7.[/b] John’s birthday cake is a scrumptious cylinder of radius $6$ inches and height $3$ inches. If his friends cut the cake into $8$ equal sectors, what is the total surface area of a piece of birthday cake?
[b]p8.[/b] Evaluate $\sum^{10}_{i=1}\sum^{10}_{j=1} ij$.
[b]p9.[/b] If three numbers $a$, $b$, and $c$ are randomly selected from the interval $[-2, 2]$, what is the probability that $a^2 + b^2 + c^2 \ge 4$?
[b]p10.[/b] Evaluate $\sum^{\infty}_{x=2} \frac{2}{x^2 - 1}.$
[b]p11.[/b] Consider $4x^2 - kx - 1 = 0$. If the roots of this polynomial are $\sin \theta$ and $\cos \theta$, compute $|k|$.
[b]p12.[/b] Given that $65537 = 2^{16} + 1$ is a prime number, compute the number of primes of the form $2^n + 1$ (for $n \ge 0$) between $1$ and $10^6$.
[b]p13.[/b] Compute $\sin^{-1}(36/85) + \cos^{-1}(4/5) + \cos^{-1}(15/17).$
[b]p14.[/b] Find the number of integers $n$, $1\le n \le 2003$, such that $n^{2003} - 1$ is a multiple of $10$.
[b]p15.[/b] Find the number of integers $n,$ $1 \le n \le 120$, such that $n^2$ leaves remainder $1$ when divided by $120$.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
We say that an integer $m$ is a perfect power if there are $a\in\mathbf{Z}$, $b\in\mathbf{N}$ with $b > 1$ such that $m = a^b$.
Find all polynomials $P\in\mathbf{Z}[x]$ such that $P(n)$ is a perfect power for every $n\in\mathbf{N}$.
Show that there exists a positive integer $ k$ such that $ k \cdot 2^{n} \plus{} 1$ is composite for all $ n \in \mathbb{N}_{0}$.
Let $f : \mathbb Q \to \mathbb Q$ be a function such that for any $x,y \in \mathbb Q$, the number $f(x+y)-f(x)-f(y)$ is an integer. Decide whether it follows that there exists a constant $c$ such that $f(x) - cx$ is an integer for every rational number $x$.
[i]Proposed by Victor Wang[/i]
In Survev.io, Calvin observes that he has exactly twice as much blue ammo as red ammo. After firing one blue bullet and $9$ red bullets, he remarks that the amount of blue ammo he has is divisible by $5$ and the amount of red ammo he has is divisible by $7$. Find the least amount of red ammo he could have started with.
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.
Let $ f(x)\equal{}5x^{13}\plus{}13x^5\plus{}9ax$. Find the least positive integer $ a$ such that $ 65$ divides $ f(x)$ for every integer $ x$.
Let $a_1 = 1$ and $a_{n+1} = a_n \cdot p_n$ for $n \geq 1$ where $p_n$ is the $n$th prime number, starting with $p_1 = 2$. Let $\tau(x)$ be equal to the number of divisors of $x$. Find the remainder when
$$\sum_{n=1}^{2020} \sum_{d \mid a_n} \tau (d)$$
is divided by 91 for positive integers $d$. Recall that $d|a_n$ denotes that $d$ divides $a_n$.
[i]Proposed by Minseok Eli Park (wolfpack)[/i]
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.