The $53$-digit number $$37,984,318,966,591,152,105,649,545,470,741,788,308,402,068,827,142,719$$ can be expressed as $n^21$ where $n$ is a positive integer. Find $n$.

If the sum of all positive divisors (including itself) of a positive integer $n$ is $2n$, then $n$ is called a perfect number. For example, the sum of the positive divisors of 6 is $1 + 2 + 3 + 6 = 2 \times 6$, hence 6 is a perfect number. Prove: There does not exist a perfect number of the form $p^a q^b r^c$, where $a, b, c$ are positive integers, and $p, q, r$ are odd primes.

For any nonempty set $S$ of real numbers, let $\sigma(S)$ denote the sum of the elements of $S$. Given a set $A$ of $n$ positive integers, consider the collection of all distinct sums $\sigma(S)$ as $S$ ranges over the nonempty subsets of $A$. Prove that this collection of sums can be partitioned into $n$ classes so that in each class, the ratio of the largest sum to the smallest sum does not exceed 2.

Let $c$ be fixed natural number. Sequence $(a_n)$ is defined by: $a_1=1$, $a_{n+1}=d(a_n)+c$ for $n=1,2,...$. where $d(m)$ is number of divisors of $m$. Prove that there exist $k$ natural such that sequence $a_k,a_{k+1},...$ is periodic.

Find the greatest natural number $n$ such there exist natural numbers $x_{1}, x_{2}, \ldots, x_{n}$ and natural $a_{1}< a_{2}< \ldots < a_{n-1}$ satisfying the following equations for $i =1,2,\ldots,n-1$: \[x_{1}x_{2}\ldots x_{n}= 1980 \quad \text{and}\quad x_{i}+\frac{1980}{x_{i}}= a_{i}.\]

[b]p5.[/b] Find the number of three-digit integers that contain at least one $0$ or $5$. The leading digit of the three-digit integer cannot be zero. [b]p6.[/b] What is the sum of the solutions to $\frac{x+8}{5x+7} =\frac{x+8}{7x+5}$ [b]p7.[/b] Let $BC$ be a diameter of a circle with center $O$ and radius $4$. Point $A$ is on the circle such that $\angle AOB = 45^o$. Point $D$ is on the circle such that line segment$ OD$ intersects line segment $AC$ at $E$ and $OD$ bisects $\angle AOC$. Compute the area of $ADE$, which is enclosed by line segments $AE$ and $ED$ and minor arc $AD$. [b]p8. [/b] William is a bacteria farmer. He would like to give his fiance$ 2021$ bacteria as a wedding gift. Since he is an intelligent and frugal bacteria farmer, he would like to add the least amount of bacteria on his favorite infinite plane petri dish to produce those $2021$ bacteria. The infinite plane petri dish starts off empty and William can add as many bacteria as he wants each day. Each night, all the bacteria reproduce through binary fission, splitting into two. If he has infinite amount of time before his wedding day, how many bacteria should he add to the dish in total to use the least number of bacteria to accomplish his nuptial goals? PS. You should use hide for answers Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A Haiku is a Japanese poem of seventeen syllables, in three lines of five, seven, and five. In how many ways Can you add three integers Summing seventeen? Order matters here. For example, eight, three, six Is not eight, six, three. All nonnegative, Do not need to be distinct. What is your answer? [i]Proposed by Derek Gao[/i]

Find the largest positive integer $n$ with the property that $n+6(p^3+1)$ is prime whenever $p$ is a prime number such that $2\le p<n$. Justify your answer.

Numbers $7^2$,$8^2,\ldots,2023^2$,$2024^2$ are written on the board. Is it possible to add to one of them $7$, to some other one $8$, $\ldots$, to the remaining $2024$ such that all numbers became prime [i]M. Zorka[/i]

Find all prime numbers $p$ such that the number $$3^p+4^p+5^p+9^p-98$$ has at most $6$ positive divisors.

All three vertices of an equilateral triangle are on the parabola $ y \equal{} x^2$, and one of its sides has a slope of 2. The x-coordinates of the three vertices have a sum of $ m/n$, where $ m$ and $ n$ are relatively prime positive integers. What is the value of $ m \plus{} n$? $ \textbf{(A)}\ 14\qquad \textbf{(B)}\ 15\qquad \textbf{(C)}\ 16\qquad \textbf{(D)}\ 17\qquad \textbf{(E)}\ 18$

Integers $x>2,\,y>1,\,z>0$ satisfy an equation $x^y+1=z^2$. Let $p$ be a number of different prime divisors of $x$, $q$ be a number of different prime divisors of $y$. Prove that $p\geq q+2$.

Find all the pairs of positive numbers such that the last digit of their sum is 3, their difference is a primer number and their product is a perfect square.

For each $ n \in \mathbb{N}$ we have two numbers $ p_n, q_n$ with the following property: For exactly $ n$ distinct integer numbers $ x$ the number \[ x^2 \plus{} p_n \cdot x \plus{} q_n\] is the square of a natural number. (Note the definition of natural numbers includes the zero here.)

[b]p1.[/b] A large square is cut into four smaller, congruent squares. If each of the smaller squares has perimeter $4$, what was the perimeter of the original square? [b]p2.[/b] Pie loves to bake apples so much that he spends $24$ hours a day baking them. If Pie bakes a dozen apples in one day, how many minutes does it take Pie to bake one apple, on average? [b]p3.[/b] Bames Jond is sent to spy on James Pond. One day, Bames sees James type in his $4$-digit phone password. Bames remembers that James used the digits $0$, $5$, and $9$, and no other digits, but he does not remember the order. How many possible phone passwords satisfy this condition? [b]p4.[/b] What do you get if you square the answer to this question, add $256$ to it, and then divide by $32$? [b]p5.[/b] Chloe the Horse and Flower the Chicken are best friends. When Chloe gets sad for any reason, she calls Flower, so Chloe must remember Flower's $3$ digit phone number, which can consist of any digits $0-5$. Given that the phone number's digits are unique and add to $5$, the number does not start with $0$, and the $3$ digit number is prime, what is the sum of all possible phone numbers? [b]p6.[/b] Anuj has a circular pizza with diameter $A$ inches, which is cut into $B$ congruent slices, where $A$,$B$ are positive integers. If one of Anuj's pizza slices has a perimeter of $3\pi + 30$ inches, find $A + B$. [b]p7.[/b] Bob really likes to study math. Unfortunately, he gets easily distracted by messages sent by friends. At the beginning of every minute, there is an $\frac{6}{10}$ chance that he will get a message from a friend. If Bob does get a message from a friend, there is a $\frac{9}{10}$ chance that he will look at the message, causing him to waste $30$ seconds before resuming his studying. If Bob doesn't get a message from a friend, there is a $\frac{3}{10}$ chance Bob will still check his messages hoping for a message from his friends, wasting $10$ seconds before he resumes his studying. What is the expected number of minutes in $100$ minutes for which Bob will be studying math? [b]p8.[/b] Suppose there is a positive integer $n$ with $225$ distinct positive integer divisors. What is the minimum possible number of divisors of n that are perfect squares? [b]p9.[/b] Let $a, b, c$ be positive integers. $a$ has $12$ divisors, $b$ has $8$ divisors, $c$ has $6$ divisors, and $lcm(a, b, c) = abc$. Let $d$ be the number of divisors of $a^2bc$. Find the sum of all possible values of $d$. [b]p10.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 17$, $BC = 28$, $AC = 25$. Let the altitude from $A$ to $BC$ and the angle bisector of angle $B$ meet at $P$. Given the length of $BP$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$ where $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime, find $a + b + c$. [b]p11.[/b] Let $a$, $b$, and $c$ be the roots of the cubic equation $x^3-5x+3 = 0$. Let $S = a^4b+ab^4+a^4c+ac^4+b^4c+bc^4$. Find $|S|$. [b]p12.[/b] Call a number palindromeish if changing a single digit of the number into a different digit results in a new six-digit palindrome. For example, the number $110012$ is a palindromeish number since you can change the last digit into a $1$, which results in the palindrome $110011$. Find the number of $6$ digit palindromeish numbers. [b]p13.[/b] Let $P(x)$ be a polynomial of degree $3$ with real coecients and leading coecient $1$. Let the roots of $P(x)$ be $a$, $b$, $c$. Given that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 4$ and $a^2 + b^2 + c^2 = 36$, the coefficient of $x^2$ is negative, and $P(1) = 2$, let the $S$ be the sum of possible values of $P(0)$. Then $|S|$ can be expressed as $\frac{a + b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ such that $gcd(a, b, d) = 1$ and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. [b]p14.[/b] Let $ABC$ be a triangle with side lengths $AB = 7$, $BC = 8$, $AC = 9$. Draw a circle tangent to $AB$ at $B$ and passing through $C$. Let the center of the circle be $O$. The length of $AO$ can be expressed as $\frac{a\sqrt{b}}{c\sqrt{d}}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c) = gcd(b, d) = 1$ and $b$,$ d$ are not divisible by the square of any prime. Find $a + b + c + d$. [b]p15.[/b] Many students in Mr. Noeth's BC Calculus class missed their first test, and to avoid taking a makeup, have decided to never leave their houses again. As a result, Mr. Noeth decides that he will have to visit their houses to deliver the makeup tests. Conveniently, the $17$ absent students in his class live in consecutive houses on the same street. Mr. Noeth chooses at least three of every four people in consecutive houses to take a makeup. How many ways can Mr. Noeth select students to take makeups? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all triplet of non-negative integers $ (x,y,z) $ satisfy $$ 2^x3^y+1=7^z $$

Show that the fraction $ \frac{n^2+n-1}{n^2+2n}$ is irreducible for every positive integer n.

[b]p1.[/b] Vivek has three letters to send out. Unfortunately, he forgets which letter is which after sealing the envelopes and before putting on the addresses. He puts the addresses on at random sends out the letters anyways. What are the chances that none of the three recipients get their intended letter? [b]p2.[/b] David is a horrible bowler. Luckily, Logan and Christy let him use bumpers. The bowling lane is $2$ meters wide, and David's ball travels a total distance of $24$ meters. How many times did David's bowling ball hit the bumpers, if he threw it from the middle of the lane at a $60^o$ degree angle to the horizontal? [b]p3.[/b] Find $\gcd \,(212106, 106212)$. [b]p4.[/b] Michael has two fair dice, one six-sided (with sides marked $1$ through $6$) and one eight-sided (with sides marked $1-8$). Michael play a game with Alex: Alex calls out a number, and then Michael rolls the dice. If the sum of the dice is equal to Alex's number, Michael gives Alex the amount of the sum. Otherwise Alex wins nothing. What number should Alex call to maximize his expected gain of money? [b]p5.[/b] Suppose that $x$ is a real number with $\log_5 \sin x + \log_5 \cos x = -1$. Find $$|\sin^2 x \cos x + \cos^2 x \sin x|.$$ [b]p6.[/b] What is the volume of the largest sphere that FIts inside a regular tetrahedron of side length $6$? [b]p7.[/b] An ant is wandering on the edges of a cube. At every second, the ant randomly chooses one of the three edges incident at one vertex and walks along that edge, arriving at the other vertex at the end of the second. What is the probability that the ant is at its starting vertex after exactly $6$ seconds? [b]p8.[/b] Determine the smallest positive integer $k$ such that there exist $m, n$ non-negative integers with $m > 1$ satisfying $$k = 2^{2m+1} - n^2.$$ [b]p9.[/b] For $A,B \subset Z$ with $A,B \ne \emptyset$, define $A + B = \{a + b|a \in A, b \in B\}$. Determine the least $n$ such that there exist sets $A,B$ with $|A| = |B| = n$ and $A + B = \{0, 1, 2,..., 2012\}$. [b]p10.[/b] For positive integers $n \ge 1$, let $\tau (n)$ and $\sigma (n)$ be, respectively, the number of and sum of the positive integer divisors of $n$ (including $1$ and $n$). For example, $\tau (1) = \sigma (1) = 1$ and $\tau (6) = 4$, $\sigma (6) = 12$. Find the number of positive integers $n \le 100$ such that $$\sigma (n) \le (\sqrt{n} - 1)^2 +\tau (n)\sqrt{n}.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$

We have $2p-1$ integer numbers, where $p$ is a prime number. Prove that we can choose exactly $p$ numbers (from these $2p-1$ numbers) so that their sum is divisible by $p$.

Find all prime numbers $p$ such that the number $$3^p+4^p+5^p+9^p-98$$ has at most $6$ positive divisors.

S is the set of all ($a$, $b$, $c$, $d$, $e$, $f$) where $a$, $b$, $c$, $d$, $e$, $f$ are integers such that $a^2 + b^2 + c^2 + d^2 + e^2 = f^2$. Find the largest $k$ which divides abcdef for all members of $S$.

Prove that there is a constant $c>0$ and infinitely many positive integers $n$ with the following property: there are infinitely many positive integers that cannot be expressed as the sum of fewer than $cn\log(n)$ pairwise coprime $n$th powers. [i]Canada[/i]

Prove that there are infinitely many distinct pairs $(a, b)$ of relatively prime integers $a>1$ and $b>1$ such that $a^b+b^a$ is divisible by $a+b$.

Show that in each set of ten consecutive integers there is one that is coprime with each of the other integers. (For example, in the set $ \{ 114,115,...,123 \}$ there are two such numbers: $ 119$ and $ 121.)$