Found problems: 526
For real number $r$ let $f(r)$ denote the integer that is the closest to $r$ (if the fractional part of $r$ is $1/2$, let $f(r)$ be $r-1/2$). Let $a>b>c$ rational numbers such that for all integers $n$ the following is true: $f(na)+f(nb)+f(nc)=n$. What can be the values of $a$, $b$ and $c$?
[i]Submitted by Gábor Damásdi, Budapest[/i]
Prove that for every positive integer $n$, there exist integers $a$ and $b$ such that $4a^2 + 9b^2 - 1$ is divisible by $n$.
For the integer $n>1$, define $D(n)=\{ a-b\mid ab=n, a>b>0, a,b\in\mathbb{N} \}$. Prove that for any integer $k>1$, there exists pairwise distinct positive integers $n_1,n_2,\ldots,n_k$ such that $n_1,\ldots,n_k>1$ and $|D(n_1)\cap D(n_2)\cap\cdots\cap D(n_k)|\geq 2$.
For a positive integer $k,$ call an integer a $pure$ $k-th$ $power$ if it can be represented as $m^k$ for some integer $m.$ Show that for every positive integer $n,$ there exists $n$ distinct positive integers such that their sum is a pure $2009-$th power and their product is a pure $2010-$th power.
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$.
Consider the multiplicative group $A=\{z\in\mathbb{C}|z^{2006^k}=1, 0<k\in\mathbb{Z}\}$ of all the roots of unity of degree $2006^k$ for all positive integers $k$.
Find the number of homomorphisms $f:A\to A$ that satisfy $f(f(x))=f(x)$ for all elements $x\in A$.
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.)
[i]Proposed by Hong Kong[/i]
Find the remainder when
$$\prod_{i = 1}^{1903} (2^i + 5)$$
is divided by $1000$.
For every integer $n$ not equal to $1$ or $-1$, define $S(n)$ as the smallest integer greater than $1$ that divides $n$. In particular, $S(0)=2$. We also define $S(1) = S(-1) = 1$.
Let $f$ be a non-constant polynomial with integer coefficients such that $S(f(n)) \leq S(n)$ for every positive integer $n$. Prove that $f(0)=0$.
[b]Note:[/b] A non-constant polynomial with integer coefficients is a function of the form $f(x) = a_0 + a_1 x + a_2 x^2 + \ldots + a_k x^k$, where $k$ is a positive integer and $a_0,a_1,\ldots,a_k$ are integers such that $a_k \neq 0$.
[i]Pitchayut Saengrungkongka, Thailand[/i]
Suppose that $a_1,...,a_{15}$ are prime numbers forming an arithmetic progression with common difference $d > 0$ if $a_1 > 15$ show that $d > 30000$
Let $\mathbb{P}$ be the set of all prime numbers. Find all functions $f:\mathbb{P}\rightarrow\mathbb{P}$ such that:
$$f(p)^{f(q)}+q^p=f(q)^{f(p)}+p^q$$
holds for all $p,q\in\mathbb{P}$.
[i]Proposed by Dorlir Ahmeti, Albania[/i]
Let $N = 123456789101112\dots4344$ be the $79$-digit number obtained that is formed by writing the integers from $1$ to $44$ in order, one after the other. What is the remainder when $N$ is divided by $45$?
$\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 18 \qquad\textbf{(E)}\ 44$
Suppose $m$ and $n$ are relatively prime positive integers. A regular $m$-gon and a regular
$n$-gon are inscribed in a circle. Let $d$ be the minimum distance in degrees (of the arc along
the circle) between a vertex of the $m$-gon and a vertex of the $n$-gon. What is the maximum
possible value of $d$?
[u]Set 1[/u]
[b]p1.[/b] Find $1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 + 11$.
[b]p2.[/b] Find $1 \cdot 11 + 2 \cdot 10 + 3 \cdot 9 + 4 \cdot 8 + 5 \cdot 7 + 6 \cdot 6$.
[b]p3.[/b] Let $\frac{1}{1\cdot 2} +\frac{1}{2\cdot 3} +\frac{1}{3\cdot 4} +\frac{1}{4\cdot 5} +\frac{1}{5\cdot 6} +\frac{1}{6\cdot 7} +\frac{1}{7\cdot 8} +\frac{1}{8\cdot 9} +\frac{1}{9\cdot 10} +\frac{1}{10\cdot 11} =\frac{m}{n}$ , where $m$ and $n$ are positive integers that share no prime divisors. Find $m + n$.
[u]Set 2[/u]
[b]p4.[/b] Define $0! = 1$ and let $n! = n \cdot (n - 1)!$ for all positive integers $n$. Find the value of $(2! + 0!)(1! + 8!)$.
[b]p5.[/b] Rachel’s favorite number is a positive integer $n$. She gives Justin three clues about it:
$\bullet$ $n$ is prime.
$\bullet$ $n^2 - 5n + 6 \ne 0$.
$\bullet$ $n$ is a divisor of $252$.
What is Rachel’s favorite number?
[b]p6.[/b] Shen eats eleven blueberries on Monday. Each day after that, he eats five more blueberries than the day before. For example, Shen eats sixteen blueberries on Tuesday. How many blueberries has Shen eaten in total before he eats on the subsequent Monday?
[u]Set 3[/u]
[b]p7.[/b] Triangle $ABC$ satisfies $AB = 7$, $BC = 12$, and $CA = 13$. If the area of $ABC$ can be expressed in the form $m\sqrt{n}$, where $n$ is not divisible by the square of a prime, then determine $m + n$.
[b]p8.[/b] Sebastian is playing the game Split! on a coordinate plane. He begins the game with one token at $(0, 0)$. For each move, he is allowed to select a token on any point $(x, y)$ and take it off the plane, replacing it with two tokens, one at $(x + 1, y)$, and one at $(x, y + 1)$. At the end of the game, for a token on $(a, b)$, it is assigned a score $\frac{1}{2^{a+b}}$ . These scores are summed for his total score. Determine the highest total score Sebastian can get in $100$ moves.
[b]p9.[/b] Find the number of positive integers $n$ satisfying the following two properties:
$\bullet$ $n$ has either four or five digits, where leading zeros are not permitted,
$\bullet$ The sum of the digits of $n$ is a multiple of $3$.
[u]Set 4[/u]
[b]p10.[/b] [i]A unit square rotated $45^o$ about a vertex,
Sweeps the area for Farmer Khiem’s pen.
If $n$ is the space the pigs can roam,
Determine the floor of $100n$.[/i]
If $n$ is the area a unit square sweeps out when rotated 4$5$ degrees about a vertex, determine $\lfloor 100n \rfloor$. Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.
[img]https://cdn.artofproblemsolving.com/attachments/b/1/129efd0dbd56dc0b4fb742ac80eaf2447e106d.png[/img]
[b]p11.[/b][i] Michael is planting four trees,
In a grid, three rows of three,
If two trees are close,
Then both are bulldozed,
So how many ways can it be?[/i]
In a three by three grid of squares, determine the number of ways to select four squares such that no two share a side.
[b]p12.[/b] [i]Three sixty-seven
Are the last three digits of
$n$ cubed. What is $n$?[/i]
If the last three digits of $n^3$ are $367$ for a positive integer $n$ less than $1000$, determine $n$.
[u]Set 5[/u]
[b]p13.[/b] Determine $\sqrt[4]{97 + 56\sqrt{3}} + \sqrt[4]{97 - 56\sqrt{3}}$.
[b]p14. [/b]Triangle $\vartriangle ABC$ is inscribed in a circle $\omega$ of radius $12$ so that $\angle B = 68^o$ and $\angle C = 64^o$ . The perpendicular from $A$ to $BC$ intersects $\omega$ at $D$, and the angle bisector of $\angle B$ intersects $\omega$ at $E$. What is the value of $DE^2$?
[b]p15.[/b] Determine the sum of all positive integers $n$ such that $4n^4 + 1$ is prime.
[u]Set 6[/u]
[b]p16.[/b] Suppose that $p, q, r$ are primes such that $pqr = 11(p + q + r)$ such that $p\ge q \ge r$. Determine the sum of all possible values of $p$.
[b]p17.[/b] Let the operation $\oplus$ satisfy $a \oplus b =\frac{1}{1/a+1/b}$ . Suppose $$N = (...((2 \oplus 2) \oplus 2) \oplus ... 2),$$ where there are $2018$ instances of $\oplus$ . If $N$ can be expressed in the form $m/n$, where $m$ and $n$ are relatively prime positive integers, then determine $m + n$.
[b]p18.[/b] What is the remainder when $\frac{2018^{1001} - 1}{2017}$ is divided by $2017$?
PS. You had better use hide for answers. Last sets have been posted [url=https://artofproblemsolving.com/community/c4h2777307p24369763]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
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$.
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
Let $f:\mathbb N\rightarrow\mathbb N$ be a non-decreasing function and let $n$ be an arbitrary natural number. Suppose that there are prime numbers $p_1,p_2,\dots,p_n$ and natural numbers $s_1,s_2,\dots,s_n$ such that for each $1\leq i\leq n$ the set $\{f(p_ir+s_i)|r=1,2,\dots\}$ is an infinite arithmetic progression. Prove that there is a natural number $a$ such that
\[f(a+1), f(a+2), \dots, f(a+n)\]
form an arithmetic progression.
Given an integer $ n > 3.$ Prove that there exists a set $ S$ consisting of $ n$ pairwisely distinct positive integers such that for any two different non-empty subset of $ S$:$ A,B, \frac {\sum_{x\in A}x}{|A|}$ and $ \frac {\sum_{x\in B}x}{|B|}$ are two composites which share no common divisors.
Find the number of integers $n$ with $1 \le n \le 2017$ so that $(n-2)(n-0)(n-1)(n-7)$ is an integer
multiple of $1001$.
For a positive integer $k$, let $p(k)$ be the smallest prime that does not divide $k$. Given a positive integer $a$, define the infinite sequence $a_0, a_1, \ldots$ by $a_0 = a$ and, for $n > 0$, $a_n$ is the smallest positive integer with the following properties:
• $a_n$ has not yet appeared in the sequence, that is, $a_n \neq a_i$ for $0 \leq i < n$;
• $(a_{n-1})^{a_n} - 1$ is a multiple of $p(a_{n-1})$.
Prove that every positive integer appears as a term in the sequence, that is, for every positive integer $m$ there is $n$ such that $a_n = m$.
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$.
For $n\ge 2$, find the number of integers $x$ with $0\le x<n$, such that $x^2$ leaves a remainder of $1$ when divided by $n$.
Let $n$ be a natural number. A sequence is $k-$complete if it contains all residues modulo $n^k$. Let $Q(x)$ be a polynomial with integer coefficients. For $k\ge 2$, define $Q^k(x)=Q(Q^{k-1}(x))$, where $Q^1(x)=Q(x)$. Show that if $$0,Q(0),Q^2(0),Q^3(0),\ldots $$is $2018-$complete, then it is $k-$complete for all positive integers $k$.
[i]Proposed by Ma Zhao Yu[/i]
Johann and Nicole are playing a game on the coordinate plane. First, Johann draws any polygon $\mathcal{S}$ and then Nicole can shift $\mathcal{S}$ to wherever she wants. Johann wins if there exists a point with coordinates $(x, y)$ in the interior of $\mathcal{S}$, where $x$ and $y$ are coprime integers. Otherwise, Nicole wins. Determine who has a winning strategy.
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$.