We say that a positive real number $d$ is $good$ if there exists an infinite squence $a_1,a_2,a_3,...\in (0,d)$ such that for each $n$, the points $a_1,a_2,...,a_n$ partition the interval $[0,d]$ into segments of length at most $\frac{1}{n}$ each . Find $\text{sup}\{d| d \text{is good}\}$.

Find integer solutions of the equation $8x^3 - 4 = y(6x - y^2)$

Consider the sequence $$1,1,2,1,2,4,1,2,4,8,1,2,4,8,16,1, . . .$$ formed by writing the first power of two, followed by the first two powers of two, followed by the first three powers of two, and so on. Find the smallest positive integer $N$ such that $N > 100$ and the sum of the first $N$ terms of this sequence is a power of two.

Four positive integers $x,y,z$ and $t$ satisfy the relations \[ xy - zt = x + y = z + t. \] Is it possible that both $xy$ and $zt$ are perfect squares?

is there a function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that $i) \exists n\in \mathbb{N}:f(n)\neq n$ $ii)$ the number of divisors of $m$ is $f(n)$ if and only if the number of divisors of $f(m)$ is $n$

For each positive integer $n$ larger than $1$ with prime factorization $p_1^{\alpha_1}p_2^{\alpha_2}\cdots p_k^{\alpha_k}$, its [i]signature[/i] is defined as the sum $\alpha_1+\alpha_2+\cdots+\alpha_k$. Does there exist $2020$ consecutive positive integers such that among them, there are exactly $1812$ integers whose signatures are strictly smaller than $11$?

Find all positive integers $ x,y,z,t$ such that $ x,y,z$ are pairwise coprime and $ (x \plus{} y)(y \plus{} z)(z \plus{} x) \equal{} xyzt$.

What is the sum of the first $31$ integers that can be written as a sum of distinct powers of $3$?

Find a four-digit perfect square whose first digit is the same as the second, and the third is the same as the fourth.

Does there exist a natural number $N$ which is a power of$2$, such that one can permute its decimal digits to obtain a different power of $2$?

Let $k = 2^6 \cdot 3^5 \cdot 5^2 \cdot 7^3 \cdot 53$. Let $S$ be the sum of $\frac{gcd(m,n)}{lcm(m,n)}$ over all ordered pairs of positive integers $(m, n)$ where $mn = k$. If $S$ can be written in simplest form as $\frac{r}{s}$, compute $r + s$.

Show that a positive integer $m$ is a sum of two triangular numbers if and only if $4m+1$ is a sum of two squares.

Find all possible integer values of the sum: $$\frac{a}{b}+ \frac{2023 \times b}{4 \times a},$$ where $a$ and $b$ are positive integers with no prime factors in common.

We say that a set $S$ of natural numbers is [i]synchronous [/i] provided that the digits of $a^2$ are the same (in occurence and numbers, if differently ordered) for all numbers $a$ in $S$. For example, $\{13, 14, 31\}$ is synchronous, since we find $\{13^2, 14^2, 31^2\} = \{169, 196, 961\}$. But $\{119, 121\}$ is not synchronous, for even though $119^2 = 14161$ and $121^2 = 14641$ have the same digits, they occur in different numbers. Show that there exists a synchronous set containing $2021$ different natural numbers.

Determine all the sets of six consecutive positive integers such that the product of some two of them . added to the product of some other two of them is equal to the product of the remaining two numbers.

A magician wants to demonstrate the following trick to an audience of $n \ge 16$ people. He gives them $15$ hats and after giving instructions to his assistant (which the audience does not hear), leaves the hall. Some $15$ people in the audience put on one of the hats. The assistant tags in front of everyone, one of the hats with a marker and then the person with an unmarked hat takes it off. The magician then returns back to the hall and after surveying the situation, knows who in the audience has taken off his hat. For what $n$ is this possible? [hide=original wording]Магьосник иска да покаже следния фокус пред публика от $n \ge 16$ души. Той им дава $15$ шапки и след като даде инструкции на помощника си (които публиката не чува), напуска залата. Някои $15$ души от публиката си слагат по една от шапките. Асистентът маркира пред всички една от шапките с маркер и след това човек с немаркирана шапка си я сваля. След това магьосникът се връща обратно в залата и след оглед на ситуацията познава кой от публиката си е свалил шапката. За кои $n$ е възможно това?[/hide]

How many integers between $1000$ and $2000$ have all three of the numbers $15$, $20$, and $25$ as factors? $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Determine for which positive integers $n$ there exists a positive integer $A$ such that • $A$ is divisible by $2022$, • the decimal expression of $A$ contains only digits $0$ and $7$, • the decimal expression of $A$ contains [i]exactly[/i] $n$ times the digit $7$.

A combination lock has a $3$ number combination, with each number an integer between $0$ and $39$ inclusive. Call the numbers $n_1$, $n_2$, and $n_3$. If you know that $n_1$ and $n_3$ leave the same remainder when divided by $4$, and $n_2$ and $n_1 + 2$ leave the same remainder when divided by $4$, how many possible combinations are there?

Assume that $a_1, a_2, a_3$ are three given positive integers consider the following sequence: $a_{n+1}=\text{lcm}[a_n, a_{n-1}]-\text{lcm}[a_{n-1}, a_{n-2}]$ for $n\ge 3$ Prove that there exist a positive integer $k$ such that $k\le a_3+4$ and $a_k\le 0$. ($[a, b]$ means the least positive integer such that$ a\mid[a,b], b\mid[a, b]$ also because $\text{lcm}[a, b]$ takes only nonzero integers this sequence is defined until we find a zero number in the sequence)

Do there exist infinitely many triples of positive integers $(a, b, c)$ such that $a$, $b$, $c$ are pairwise coprime, and $a! + b! + c!$ is divisible by $a^2 + b^2 + c^2$? [i]Proposed by Anzo Teh Zhao Yang[/i]

Georg has a board displaying the numbers from $1$ to $50$. Georg may strike out a number if it can be formed by starting with the number $2$ and doing one or more calculations where he either multiplies by $10$ or subtracts $3$. Which of the board’s numbers may Georg strike out?[img]https://cdn.artofproblemsolving.com/attachments/c/e/1bea13b691d3591d782e698bedee3235f8512f.png[/img] Example: Georg may strike out $26$ because it may, for example, be formed by starting with $2$, multiplying by $10$, subtracting $3$ three times, multiplying by $10$ and subtracting $3$ twenty-eight times.

[b]p1.[/b] The remainder of a number when divided by $7$ is $5$. If I multiply the number by $32$ and add $18$ to the product, what is the new remainder when divided by $7$? [b]p2.[/b] If a fair coin is flipped $15$ times, what is the probability that there are more heads than tails? [b]p3.[/b] Let $-\frac{\sqrt{p}}{q}$ be the smallest nonzero real number such that the reciprocal of the number is equal to the number minus the square root of the square of the number, where $p$ and $q$ are positive integers and $p$ is not divisible the square of any prime. Find $p + q$. [b]p4.[/b] Rachel likes to put fertilizers on her grass to help her grass grow. However, she has cows there as well, and they eat $3$ little fertilizer balls on average. If each ball is spherical with a radius of $4$, then the total volume that each cow consumes can be expressed in the form $a\pi$ where $a$ is an integer. What is $a$? [b]p5.[/b] One day, all $30$ students in Precalc class are bored, so they decide to play a game. Everyone enters into their calculators the expression $9 \diamondsuit 9 \diamondsuit 9 ... \diamondsuit 9$, where $9$ appears $2020$ times, and each $\diamondsuit$ is either a multiplication or division sign. Each student chooses the signs randomly, but they each choose one more multiplication sign than division sign. Then all $30$ students calculate their expression and take the class average. Find the expected value of the class average. [b]p6.[/b] NaNoWriMo, or National Novel Writing Month, is an event in November during which aspiring writers attempt to produce novel-length work - formally defined as $50,000$ words or more - within the span of $30$ days. Justin wants to participate in NaNoWriMo, but he's a busy high school student: after accounting for school, meals, showering, and other necessities, Justin only has six hours to do his homework and perhaps participate in NaNoWriMo on weekdays. On weekends, he has twelve hours on Saturday and only nine hours on Sunday, because he goes to church. Suppose Justin spends two hours on homework every single day, including the weekends. On Wednesdays, he has science team, which takes up another hour and a half of his time. On Fridays, he spends three hours in orchestra rehearsal. Assume that he spends all other time on writing. Then, if November $1$st is a Friday, let $w$ be the minimum number of words per minute that Justin must type to finish the novel. Round $w$ to the nearest whole number. [b]p7.[/b] Let positive reals $a$, $b$, $c$ be the side lengths of a triangle with area $2030$. Given $ab + bc + ca = 15000$ and $abc = 350000$, find the sum of the lengths of the altitudes of the triangle. [b]p8.[/b] Find the minimum possible area of a rectangle with integer sides such that a triangle with side lengths $3$, $4$, $5$, a triangle with side lengths $4$, $5$, $6$, and a triangle with side lengths $\frac94$, $4$, $4$ all fit inside the rectangle without overlapping. [b]p9.[/b] The base $16$ number $10111213...99_{16}$, which is a concatenation of all of the (base $10$) $2$-digit numbers, is written on the board. Then, the last $2n$ digits are erased such that the base $10$ value of remaining number is divisible by $51$. Find the smallest possible integer value of $n$. [b]p10.[/b] Consider sequences that consist entirely of $X$'s, $Y$ 's and $Z$'s where runs of consecutive $X$'s, $Y$ 's, and $Z$'s are at most length $3$. How many sequences with these properties of length $8$ are there? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f:\mathbb{Z}_{>0}\mapsto\mathbb{Z}_{>0}$ such that $$xf(x)+(f(y))^2+2xf(y)$$ is perfect square for all positive integers $x,y$. **This problem was proposed by me for the BMO 2017 and it was shortlisted. We then used it in our TST.

Let $p_1,p_2,p_3$ be primes with $p_2\neq p_3$ such that $4+p_1p_2$ and $4+p_1p_3$ are perfect squares. Find all possible values of $p_1,p_2,p_3$.