For any positive integer $n{}$ define $a_n=\{n/s(n)\}$ where $s(\cdot)$ denotes the sum of the digits and $\{\cdot\}$ denotes the fractional part.[list=a] [*]Prove that there exist infinitely many positive integers $n$ such that $a_n=1/2.$ [*]Determine the smallest positive integer $n$ such that $a_n=1/6.$ [/list] [i]Marius Burtea[/i]

Given a list of integers $2^1+1, 2^2+1, \ldots, 2^{2019}+1$, Adam chooses two different integers from the list and computes their greatest common divisor. Find the sum of all possible values of this greatest common divisor.

If $A_i=\frac{x-a_i}{|x-a_i|}$, $i=1,2,\cdots,n$ for $n$ numbers $a_1<a_2<\cdots<a_m<\cdots<a_n,$ then $\lim \limits_{x\to a_m}\Big(A_1A_2\cdots A_n\Big)=?$ [list=1] [*] $(-1)^{m-1}$ [*] $(-1)^m$ [*] $1$ [*] None of these [/list]

Jonathan finds all ordered triples $(a, b, c)$ of positive integers such that $abc = 720$. For each ordered triple, he writes their sum $a + b + c$ on the board. (Numbers may appear more than once.) What is the sum of all the numbers written on the board?

Find all pairs of positive integers $(a,b)$ such that $a^2 + b^2$ divides both $a^3 + 1$ and $b^3 + 1$.

Given a positive integer $ n> 2 $. Prove that there exists a natural $ K $ such that for all integers $ k \ge K $ on the open interval $ ({{k} ^{n}}, \ {{(k + 1)} ^{n}}) $ there are $n$ different integers, the product of which is the $n$-th power of an integer.

Two sequences $(a_k)_{k\ge 0}$ and $(b_k)_{k\ge 0}$ of integers are given by $b_k = a_k + 9$ and $a_{k+1} = 8b_k + 8$ for $k\ge 0$. Suppose that the number $1988$ occurs in one of these sequences. Show that the sequence $(a_k)$ does not contain any nonzero perfect square.

For what positive integers $n$ and $k$ do there exits integers $a_1,a_2,\dots,a_n$ and $b_1,b_2,\dots,b_k$ such that the products $a_ib_j$ ($1\le i\le n,1\le j\le k$) give pairwise different residues modulo $nk$?

[b]p1.[/b] Catherine's teacher thinks of a number and asks her to subtract $5$ and then multiply the result by $6$. Catherine accidentally switches the numbers by subtracting 6 and multiplying by $5$ to get $30$. If Catherine had not swapped the numbers, what would the correct answer be? [b]p2.[/b] At Acton Boxborough Regional High School, desks are arranged in a rectangular grid-like configuration. In order to maintain proper social distancing, desks are required to be at least 6 feet away from all other desks. Assuming that the size of the desks is negligible, what is the maximum number of desks that can fit in a $25$ feet by $25$ feet classroom? [b]p3.[/b] Joshua hates writing essays for homework, but his teacher Mr. Meesh assigns two essays every $3$ weeks. However, Mr. Meesh favors Joshua, so he allows Joshua to skip one essay out of every $4$ that are assigned. How many essays does Joshua have to write in a $24$-week school year? [b]p4.[/b] Libra likes to read, but she is easily distracted. If a page number is even, she reads the page twice. If a page number is an odd multiple of three, she skips it. Otherwise, she reads the page exactly once. If Libra's book is $405$ pages long, how many pages in total does she read if she starts on page $1$? (Reading the same page twice counts as two pages.) [b]p5.[/b] Let the GDP of an integer be its Greatest Divisor that is Prime. For example, the GDP of $14$ is $7$. Find the largest integer less than $100$ that has a GDP of $3$. [b]p6.[/b] As has been proven by countless scientific papers, the Earth is a flat circle. Bob stands at a point on the Earth such that if he walks in a straight line, the maximum possible distance he can travel before he falls off is $7$ miles, and the minimum possible distance he can travel before he falls off is $3$ miles. Then the Earth's area in square miles is $k\pi$ for some integer $k$. Compute $k$. [b]p7.[/b] Edward has $2$ magical eggs. Every minute, each magical egg that Edward has will double itself. But there's a catch. At the end of every minute, Edward's brother Eliot will come outside and smash one egg on his forehead, causing Edward to lose that egg permanently. For example, starting with $2$ eggs, after one minute there will be $3$ eggs, then $5$, $9$, and so on. After $1$ hour, the number of eggs can be expressed as $a^b + c$ for positive integers $a$, $b$, $c$ where $a > 1$, and $a$ and $c$ are as small as possible. Find $a + b + c$. [b]p8.[/b] Define a sequence of real numbers $a_1$, $a_2$, $a_3$, $..$, $a_{2019}$, $a_{2020}$ with the property that $a_n =\frac{a_{n-1} + a_n + a_{n+1}}{3}$ for all $n = 2$, $3$, $4$, $5$,$...$, $2018$, $2019$. Given that $a_1 = 1$ and $a_{1000} = 1999$, find $a_{2020}$. [b]p9.[/b] In $\vartriangle ABC$ with $AB = 10$ and $AC = 12$, points $D$ and $E$ lie on sides $\overline{AB}$ and $\overline{AC}$, respectively, such that $AD = 4$ and $AE = 5$. If the area of quadrilateral $BCED$ is $40$, find the area of $\vartriangle ADE$. [b]p10.[/b] A positive integer is called powerful if every prime in its prime factorization is raised to a power greater than or equal to $2$. How many positive integers less than 100 are powerful? [b]p11.[/b] Let integers $A,B < 10, 000$ be the populations of Acton and Boxborough, respectively. When $A$ is divided by $B$, the remainder is $1$. When $B$ is divided by $A$, the remainder is $2020$. If the sum of the digits of $A$ is $17$, find the total combined population of Acton and Boxborough. [b]p12.[/b] Let $a_1$, $a_2$, $...$, $a_n$ be an increasing arithmetic sequence of positive integers. Given $a_n - a_1 = 20$ and $a^2_n - a^2_{n-1} = 63$, find the sum of the terms in the arithmetic sequence. [b]p13.[/b] Bob rolls a cubical, an octahedral and a dodecahedral die ($6$, $8$ and $12$ sides respectively) numbered with the integers from $1$ to $6$, $1$ to $8$ and $1$ to $12$ respectively. If the probability that the sum of the numbers on the cubical and octahedral dice equals the number on the dodecahedral die can be written as $\frac{m}{n}$ , where $m, n$ are relatively prime positive integers, compute $n - m$. [b]p14.[/b] Let $\vartriangle ABC$ be inscribed in a circle with center $O$ with $AB = 13$, $BC = 14$, $AC = 15$. Let the foot of the perpendicular from $A$ to BC be $D$ and let $AO$ intersect $BC$ at $E$. Given the length of $DE$ can be expressed as $\frac{m}{n}$ where $m$, $n$ are relatively prime positive integers, find $m + n$. [b]p15.[/b] The set $S$ consists of the first $10$ positive integers. A collection of $10$ not necessarily distinct integers is chosen from $S$ at random. If a particular number is chosen more than once, all but one of its occurrences are removed. Call the set of remaining numbers $A$. Let $\frac{a}{b}$ be the expected value of the number of the elements in $A$, where $a, b$ are relatively prime positive integers. Find the reminder when $a + b$ is divided by $1000$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all pairs of $(x, y)$ of positive integers such that $2x + 7y$ divides $7x + 2y$.

10 students are arranged in a row. Every minute, a new student is inserted in the row (which can occur in the front and in the back as well, hence $11$ possible places) with a uniform $\tfrac{1}{11}$ probability of each location. Then, either the frontmost or the backmost student is removed from the row (each with a $\tfrac{1}{2}$ probability). Suppose you are the eighth in the line from the front. The probability that you exit the row from the front rather than the back is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $100m+n$. [i]Proposed by Lewis Chen[/i]

Find all positive integers $n$ for which there exists a positive integer $k$ such that the decimal representation of $n^k$ starts and ends with the same digit.

For every natural number $a$ and $b$, define the notation $[a,b]$ as the least common multiple of $a $ and $b$ and the notation $(a,b)$ as the greatest common divisor of $a$ and $b$. Find all $n \in \mathbb{N}$ that satisfies \[ 4 \sum_{k=1}^{n} [n,k] = 1 + \sum_{k=1}^{n} (n,k) + 2n^2 \sum_{k=1}^{n} \frac{1}{(n,k)} \]

Determine the maximum integer $ n $ such that for each positive integer $ k \le \frac{n}{2} $ there are two positive divisors of $ n $ with difference $ k $.

a) Let $m$ and $n$ be natural numbers. For some nonnegative integers $k_1, k_2, ... , k_n$ the number $$2^{k_1}+2^{k_2}+...+2^{k_n}$$ is divisible by $(2^m-1)$. Prove that $n \ge m$. b) Can you find a number, divisible by $111...1$ ($m$ times "$1$"), that has the sum of its digits less than $m$?

Determine all integers $n \geq 2$, satisfying $$n=a^2+b^2,$$ where $a$ is the smallest divisor of $n$ different from $1$ and $b$ is an arbitrary divisor of $n$. [i]Proposed by Walther Janous[/i]

Find the sum $$\sum^{2020}_{n=1} \gcd (n^3 -2n^2 +2021,n^2 -3n +3).$$

$n$ is a product of some two consecutive primes. $s(n)$ denotes the sum of the divisors of $n$ and $p(n)$ denotes the number of relatively prime positive integers not exceeding $n$. Express $s(n)p(n)$ as a polynomial of $n$.

Show that there are no integers $n$ such that $n^4 + 4^n$ is a prime greater than $5$.

Prove that there exist infinitely many pairs $(a, b)$ of relatively prime positive integers such that \[\frac{a^{2}-5}{b}\;\; \text{and}\;\; \frac{b^{2}-5}{a}\] are both positive integers.

Let $N>= 2$ be an integer. Show that $4n(N-n)+1$ is never a perfect square for each natural number $n$ less than $N$ if and only if $N^2+1$ is prime.

Find all three digit numbers $n$ which are equal to the number formed by three last digit of $n^2$.

Let $p$ be a prime and $k$ be a positive integer. Set $S$ contains all positive integers $a$ satisfying $1\le a \le p-1$, and there exists positive integer $x$ such that $x^k\equiv a \pmod p$. Suppose that $3\le |S| \le p-2$. Prove that the elements of $S$, when arranged in increasing order, does not form an arithmetic progression.

Let $n$ be a fixed natural number. Find all $n$ tuples of natural pairwise distinct and coprime numbers like $a_1,a_2,\ldots,a_n$ such that for $1\leq i\leq n$ we have \[ a_1+a_2+\ldots+a_n|a_1^i+a_2^i+\ldots+a_n^i \]

Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.