Consider the equation \[x^2 + y^2 + z^2 + t^2 - N \cdot x \cdot y \cdot z \cdot t - N = 0\] where $N$ is a given positive integer. a) Prove that for an infinite number of values of $N$, this equation has positive integral solutions (each such solution consists of four positive integers $x, y, z, t$), b) Let $N = 4 \cdot k \cdot (8 \cdot m + 7)$ where $k,m$ are no-negative integers. Prove that the considered equation has no positive integral solutions.

Solve in integers the equation $x^6+x^5+4=y^2. $ [i]Ioan Cucurezeanu[/i]

[u]Round 1[/u] [b]p1.[/b] Nineteen witches, all of different heights, stand in a circle around a campfire. Each witch says whether she is taller than both of her neighbors, shorter than both, or in-between. Exactly three said “I am taller.” How many said “I am in-between”? [b]p2.[/b] Alex is writing a sequence of $A$’s and $B$’s on a chalkboard. Any $20$ consecutive letters must have an equal number of $A$’s and $B$’s, but any 22 consecutive letters must have a different number of $A$’s and $B$’s. What is the length of the longest sequence Alex can write?. [b]p3.[/b] A police officer patrols a town whose map is shown. The officer must walk down every street segment at least once and return to the starting point, only changing direction at intersections and corners. It takes the officer one minute to walk each segment. What is the fastest the officer can complete a patrol? [img]https://cdn.artofproblemsolving.com/attachments/a/3/78814b37318adb116466ede7066b0d99d6c64d.png[/img] [b]p4.[/b] A zebra is a new chess piece that jumps in the shape of an “L” to a location three squares away in one direction and two squares away in a perpendicular direction. The picture shows all the moves a zebra can make from its given position. Is it possible for a zebra to make a sequence of $64$ moves on an $8\times 8$ chessboard so that it visits each square exactly once and returns to its starting position? [img]https://cdn.artofproblemsolving.com/attachments/2/d/01a8af0214a2400b279816fc5f6c039320e816.png[/img] [b]p5.[/b] Ann places the integers $1, 2,..., 100$ in a $10 \times 10$ grid, however she wants. In each round, Bob picks a row or column, and Ann sorts it from lowest to highest (left-to-right for rows; top-to-bottom for columns). However, Bob never sees the grid and gets no information from Ann. After eleven rounds, Bob must name a single cell that is guaranteed to contain a number that is at least $30$ and no more than $71$. Can he find a strategy to do this, no matter how Ann originally arranged the numbers? [u]Round 2[/u] [b]p6.[/b] Evelyn and Odette are playing a game with a deck of $101$ cards numbered $1$ through $101$. At the start of the game the deck is split, with Evelyn taking all the even cards and Odette taking all the odd cards. Each shuffles her cards. On every move, each player takes the top card from her deck and places it on a table. The player whose number is higher takes both cards from the table and adds them to the bottom of her deck, first the opponent’s card, then her own. The first player to run out of cards loses. Card $101$ was played against card $2$ on the $10$th move. Prove that this game will never end. [img]https://cdn.artofproblemsolving.com/attachments/8/1/aa16fe1fb4a30d5b9e89ac53bdae0d1bdf20b0.png[/img] [b]p7.[/b] The Vogon spaceship Tempest is descending on planet Earth. It will land on five adjacent buildings within a $10 \times 10$ grid, crushing any teacups on roofs of buildings within a $5 \times 1$ length of blocks (vertically or horizontally). As Commander of the Space Force, you can place any number of teacups on rooftops in advance. When the ship lands, you will hear how many teacups the spaceship breaks, but not where they were. (In the figure, you would hear $4$ cups break.) What is the smallest number of teacups you need to place to ensure you can identify at least one building the spaceship landed on? [img]https://cdn.artofproblemsolving.com/attachments/8/7/2a48592b371bba282303e60b4ff38f42de3551.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For all integers $n\geq 2$, let $f(n)$ denote the largest positive integer $m$ such that $\sqrt[m]{n}$ is an integer. Evaluate \[f(2)+f(3)+\cdots+f(100).\]

Solve: $a, b, m, n\in \mathbb{N}$ $a^2+b^2=m^2-n^2, ab=2mn$

Find all functions $f:\mathbb{Z}_{\ge 1}\to \mathbb{R}_{>0}$ such that for all positive integers $n$ the following relation holds: $$\sum_{d|n} f(d)^3=\left (\sum_{d|n} f(d) \right )^2,$$ where both sums are taken over the positive divisors of $n$. [i] (Vlad Robu) [/i]

Let $0 \leq k < n$ be integers and $A=\{a \: : \: a \equiv k \pmod n \}.$ Find the smallest value of $n$ for which the expression \[ \frac{a^m+3^m}{a^2-3a+1} \] does not take any integer values for $(a,m) \in A \times \mathbb{Z^+}.$

Two digits one are written at the ends of a segment. In the middle, their sum is written, the number 2. Then, in the middle between each two neighboring numbers written, their sum is written again, and so on, 1973 times. How many times will the number 1973 be written? [i]Proposed by G. Halperin[/i]

Let $a_1, a_2,..., a_9$ be integers. Prove that if $19$ divides $a_1^9+a_2^9+...+a_9^9$ then $19$ divides the product $a_1a_2...a_9$.

Let $n$ and $p$ be two integers with $p$ positive prime, such that $pn + 1$ is a perfect square. Show that $n + 1$ is the sum of $p$ perfect squares, not necessarily distinct.

Let $n \ge 3$ be a positive integer. Suppose that $\Gamma$ is a unit circle passing through a point $A$. A regular $3$-gon, regular $4$-gon, \dots, regular $n$-gon are all inscribed inside $\Gamma$ such that $A$ is a common vertex of all these regular polygons. Let $Q$ be a point on $\Gamma$ such that $Q$ is a vertex of the regular $n$-gon, but $Q$ is not a vertex of any of the other regular polygons. Let $\mathcal{S}_n$ be the set of all such points $Q$. Find the number of integers $3 \le n \le 100$ such that \[ \prod_{Q \in \mathcal{S}_n} |AQ| \le 2. \]

For how many positive integers $n \le 500$ is $n!$ divisible by $2^{n-2}$? [i]Proposed by Eugene Chen[/i]

[b]p1.[/b] James has $8$ Instagram accounts, $3$ Facebook accounts, $4$ QQ accounts, and $3$ YouTube accounts. If each Instagram account has $19$ pictures, each Facebook account has $5$ pictures and $9$ videos, each QQ account has a total of $17$ pictures, and each YouTube account has $13$ videos and no pictures, how many pictures in total does James have in all these accounts? [b]p2.[/b] If Poonam can trade $7$ shanks for $4$ shinks, and she can trade $10$ shinks for $17$ shenks. How many shenks can Poonam get if she traded all of her $105$ shanks? [b]p3.[/b] Jerry has a bag with $3$ red marbles, $5$ blue marbles and $2$ white marbles. If Jerry randomly picks two marbles from the bag without replacement, the probability that he gets two different colors can be expressed as a fraction $\frac{m}{n}$ in lowest terms. What is $m + n$? [b]p4.[/b] Bob's favorite number is between $1200$ and $4000$, divisible by $5$, has the same units and hundreds digits, and the same tens and thousands digits. If his favorite number is even and not divisible by $3$, what is his favorite number? [b]p5.[/b] Consider a unit cube $ABCDEFGH$. Let $O$ be the center of the face $EFGH$. The length of $BO$ can be expressed in the form $\frac{\sqrt{a}}{b}$, where $a$ and $b$ are simplified to lowest terms. What is $a + b$? [b]p6.[/b] Mr. Eddie Wang is a crazy rich boss who owns a giant company in Singapore. Even though Mr. Wang appears friendly, he finds great joy in firing his employees. His immediately fires them when they say "hello" and/or "goodbye" to him. It is well known that $1/2$ of the total people say "hello" and/or "goodbye" to him everyday. If Mr. Wang had $2050$ employees at the end of yesterday, and he hires $2$ new employees at the beginning of each day, in how many days will Mr. Wang first only have $6$ employees left? [b]p7.[/b] In $\vartriangle ABC$, $AB = 5$, $AC = 6$. Let $D,E,F$ be the midpoints of $\overline{BC}$, $\overline{AC}$, $\overline{AB}$, respectively. Let $X$ be the foot of the altitude from $D$ to $\overline{EF}$. Let $\overline{AX}$ intersect $\overline{BC}$ at $Y$ . Given $DY = 1$, the length of $BC$ is $\frac{p}{q}$ for relatively prime positive integers $p, q$: Find $p + q$. [b]p8.[/b] Given $\frac{1}{2006} = \frac{1}{a} + \frac{1}{b}$ where $a$ is a $4$ digit positive integer and $b$ is a $6$ digit positive integer, find the smallest possible value of $b$. [b]p9.[/b] Pocky the postman has unlimited stamps worth $5$, $6$ and $7$ cents. However, his post office has two very odd requirements: On each envelope, an odd number of $7$ cent stamps must be used, and the total number of stamps used must also be odd. What is the largest amount of postage money Pocky cannot make with his stamps, in cents? [b]p10.[/b] Let $ABCDEF$ be a regular hexagon with side length $2$. Let $G$ be the midpoint of side $DE$. Now let $O$ be the intersection of $BG$ and $CF$. The radius of the circle inscribed in triangle $BOC$ can be expressed in the form $\frac{a\sqrt{b}-\sqrt{c}}{d} $ where $a$, $b$, $c$, $d$ are simplified to lowest terms. What is $a + b + c + d$? [b]p11.[/b] Estimation (Tiebreaker): What is the total number of characters in all of the participants' email addresses in the Accuracy Round? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Real numbers $x$ and $y$ are chosen independently and uniformly at random from the interval $[-1,1].$ Find the probability that $$|x|+|y|+1 \le 3\min\{|x+y+1|, |x+y-1|\}.$$

Let $A = \{a_1, \dots, a_{2024}\}$ be a set of $2024$ pairwise distinct real numbers. Assume that there exist positive integers $b_1, b_2,\dotsc,b_{2024}$ such that \[ a_1b_1 + a_2b_2 + \dots + a_{2024}b_{2024} = 0. \] Prove that one can choose $a_{2025}, a_{2026}, a_{2027}, \dots$ such that $a_k \in A$ for all $k \ge 2025$ and, for every positive integer $d$, there exist infinitely many positive integers $n$ satisfying \[ \sum_{k=1}^n a_k k^d = 0. \] [i]Daniel Zhu[/i]

For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ [i]Proposed by Warut Suksompong, Thailand[/i]

Prove that for every integer $n\ge 3$ there are such positives integers $x$ and $y$ such that $2^n = 7x^2 + y^2$

Prove that $(2m)!(2n)!$ is a multiple of $m!n!(m+n)!$ for any non-negative integers $m$ and $n$.

Suppose $r$ is a real number for which \[ \left\lfloor r + \frac{19}{100} \right\rfloor + \left\lfloor r + \frac{20}{100} \right\rfloor + \left\lfloor r + \frac{21}{100} \right\rfloor + \cdots + \left\lfloor r + \frac{91}{100} \right\rfloor = 546. \] Find $\lfloor 100r \rfloor$. (For real $x$, $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.)

Given are real $y>1$ and positive integer $n \leq y^{50}$ such that all prime divisors of $n$ do not exceed $y$. Prove that $n$ is a product of $99$ positive integer factors (not necessarily primes) not exceeding $y$.

Let \( \varphi \) be the Euler's totient function. 1. For any given integer \( a > 1 \), does there exist \( l \in \mathbb{N}_+ \) such that for any \( k \in \mathbb{N}_+ \), \( l \mid k \) and \( a^2 \nmid l \), \( \frac{\varphi(k)}{\varphi(l)} \) is a non-negative power of \( a \)? 2. For integer \( x > a \), are there integers \( k_1 \) and \( k_2 \) satisfying: \[ \varphi(k_i) \in \left ( \frac{x}{a} ,x \right ], i = 1,2; \quad \varphi(k_1) \neq \varphi(k_2). \] And these two different \( k_i \) correspond to the same \( l_1 \) and \( l_2 \) as described in (1), yet \( \varphi(l_1) = \varphi(l_2) \). 3. Define \( \#E \) as the number of elements in set \( E \). For integer \( x > a \), let \( V(x) = \#\{v \in \mathbb{N}_+ \mid v = \varphi(k) \leq x\} \) and \( W(x) = \#\{w \in \mathbb{N}_+ \mid w = \varphi(l) \leq x, a^2 \mid l\} \). Compare \( V\left( \frac{x}{a} \right) \) with \( W(x) \).

The Fibonacci sequence $\{F_n\}$ is defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1} + F_n$ for all positive integers $n$. Determine all triplets of positive integers $(k,m,n)$ such that $F_n = F_m^k$.

Define a sequence ${{a_n}}_{n\ge1}$ such that $a_1=1$ , $a_2=2$ and $a_{n+1}$ is the smallest positive integer $m$ such that $m$ hasn't yet occurred in the sequence and also $gcd(m,a_n)\neq{1}$. Show that all positive integers occur in the sequence.

Let $x =\sqrt{a}+\sqrt{b}$, where $a$ and $b$ are natural numbers, $x$ is not an integer, and $x < 1976$. Prove that the fractional part of $x$ exceeds $10^{-19.76}$.

Find all positive integers $n$ such that the number $n^5+79$ has all the same digits when it is written in decimal represantation.