Does there exist a natural number $ n$ such that $ n>2$ and the sum of squares of some $ n$ consecutive integers is a perfect square?

Let $k$ be a given even positive integer. Sarah first picks a positive integer $N$ greater than $1$ and proceeds to alter it as follows: every minute, she chooses a prime divisor $p$ of the current value of $N$, and multiplies the current $N$ by $p^k -p^{-1}$ to produce the next value of $N$. Prove that there are infinitely many even positive integers $k$ such that, no matter what choices Sarah makes, her number $N$ will at some point be divisible by $2018$.

$n>1$ and distinct positive integers $a_1,a_2,\ldots,a_{n+1}$ are  given. Does there exist a polynomial $p(x)\in\Bbb{Z}[x]$ of degree  $\le n$ that satisfies the following conditions? a. $\forall_{1\le i < j\le n+1}: \gcd(p(a_i),p(a_j))>1 $ b. $\forall_{1\le i < j < k\le n+1}: \gcd(p(a_i),p(a_j),p(a_k))=1 $ [i]Proposed by Mojtaba Zare[/i]

Let $a, b, c$ be integers. Prove that there are integers $p_1, q_1, r_1, p_2, q_2, r_2$ such that \[a = q_1r_2 - q_2r_1, b = r_1p_2 - r_2p_1, c = p_1q_2 - p_2q_1.\]

[hide=Rules]Time Limit: 25 minutes Maximum Possible Score: 81 The following is a mathematical Sudoku puzzle which is also a crossword. Your job is to fill in as many blanks as you possibly can, including all shaded squares. You do not earn extra points for showing your work; the only points you get are for correctly filled-in squares. You get one point for each correctly filled-in square. You should read through the following rules carefully before starting. $\bullet$ Your time limit for this round is $25$ minutes, in addition to the five minutes you get for reading the rules. So make use of your time wisely. The round is based more on speed than on perfect reasoning, so use your intuition well, and be fast. $\bullet$ This is a Sudoku puzzle; all the squares should be filled in with the digits $1$ through $9$ so that every row and column contains each digit exactly once. In addition, each of the nine $3\times 3$ boxes that compose the grid also contains each digit exactly once. Furthermore, this is a super-Sudoku puzzle; in addition to satisfying all these conditions, the four $3\times 3$ boxes with red outlines also contain each of $1,..., 9$ exactly once. This last property is important to keep in mind – it may help you solve the puzzle faster. $\bullet$ Just to restate the idea, you can use the digits $1$ through $9$, but not $0$. You may not use any other symbol, such as $\pi$ or $e$ or $\epsilon$. Each square gets exactly one digit. $\bullet$ The grid is also a crossword puzzle; the usual rules apply. The shaded grey squares are the “black” squares of an ordinary crossword puzzle. The white squares as well as the shaded yellow ones count as the “white” crossword squares. All squares, white or shaded, count as ordinary Sudoku squares. $\bullet$ If you obtain the unique solution to the crossword puzzle, then this solution extends to a unique solution to the Sudoku puzzle. $\bullet$ You may use a graphing calculator to help you solve the clues. The following hints and tips may prove useful while solving the puzzle. $\bullet$ Use the super-Sudoku structure described in the first rule; use all the symmetries you have. Remember that we are not looking for proofs or methods, only for correctly filled-in squares. $\bullet$ If you find yourself stuck on a specific clue, it is nothing to worry about. You can obtain the solution to that clue later on by solving other clues and figuring out certain digits of your desired solution. Just move on to the rest of the puzzle. $\bullet$ As you progress through the puzzle, keep filling in all squares you have found on your solution sheet, including the shaded ones. Remember that for scoring, the shaded grey squares count the same as the white ones. Good luck! [/hide] [asy] // place label "s" in row i, column j void labelsq(int i, int j, string s) { label("$"+s+"$",(j-0.5,7.5-i),fontsize(14)); } // for example, use the command // labelsq(1,7,"2"); // to put the digit 2 in the top right box // **** rest of code **** size(250); defaultpen(linewidth(1)); pair[] labels = {(1,1),(1,4),(1,6),(1,7),(1,9),(2,1),(2,6),(3,4),(4,1),(4,8),(5,1),(6,3),(6,5),(6,6),(7,1),(7,2),(7,7),(7,9),(8,1),(8,4),(9,1),(9,6)}; pair[] blacksq = {(1,5),(2,5),(3,2),(3,3),(3,8),(5,5),(5,6),(5,7),(5,9),(6,2),(6,7),(6,9),(8,3),(9,5),(9,8)}; path peachsq = shift(1,1)*scale(3)*unitsquare; pen peach = rgb(0.98,0.92,0.71); pen darkred = red + linewidth(2); fill(peachsq,peach); fill(shift(4,0)*peachsq,peach); fill(shift(4,4)*peachsq,peach); fill(shift(0,4)*peachsq,peach); for(int i = 0; i < blacksq.length; ++i) fill(shift(blacksq[i].y-1, 9-blacksq[i].x)*unitsquare, gray(0.6)); for(int i = 0; i < 10; ++i) { pen sudokuline = linewidth(1); if(i == 3 || i == 6) sudokuline = linewidth(2); draw((0,i)--(9,i),sudokuline); draw((i,0)--(i,9),sudokuline); } draw(peachsq,darkred); draw(shift(4,0)*peachsq,darkred); draw(shift(4,4)*peachsq,darkred); draw(shift(0,4)*peachsq,darkred); for(int i = 0; i < labels.length; ++i) label(string(i+1), (labels[i].y-1, 10-labels[i].x), SE, fontsize(10)); // **** draw letters **** draw(shift(.5,.5)*((0,6)--(0,8)--(2,8)--(2,7)--(0,7)^^(3,8)--(3,6)--(5,6)--(5,8)^^(6,6)--(6,8)--(7,8)--(7,7)--(7,8)--(8,8)--(8,6)^^(0,3)--(0,5)--(2,5)--(2,3)--(2,4)--(0,4)^^(5,3)--(3,3)--(3,5)--(5,5)),linewidth(1)+rgb(0.94,0.74,0.58)); // **** end rest of code ****[/asy] [b][u][i]Across[/i][/u][/b] [b]1 Across.[/b] The following is a normal addition where each letter represents a (distinct) digit: $$GOT + TO + GO + TO = TOP$$This certainly does not have a unique solution. However, you discover suddenly that $G = 2$ and $P \notin \{4, 7\}$. Then what is the numeric value of the expression $GOT \times TO$? [b]3 Across.[/b] A strobogrammatic number which reads the same upside down, e.g. $619$. On the other hand, a triangular number is a number of the form $n(n + 1)/2$ for some $n \in N$, e.g. $15$ (therefore, the $i^{th}$ triangular number $T_i$ is the sum of $1$ through $i$). Let $a$ be the third strobogrammatic prime number. Let $b$ be the smaller number of the smallest pair of triangular numbers whose sum and difference are also triangular numbers. What is the value of $ab$? [b]6 Across.[/b] A positive integer $m$ is said to be palindromic in base $\ell$ if, when written in base $\ell$ , its digits are the same front-to-back and back-to-front. For $j, k \in N$, let $\mu (j, k)$ be the smallest base-$10$ integer that is palindromic in base $j$ as well as in base$ k$, and let $\nu (j, k) := (j + k) \cdot \mu (j, k)$. Find the value of $\nu (5, 9)$. [b]7 Across.[/b] Suppose you have the unique solution to this Sudoku puzzle. In that solution, let $X$ denote the sum of all digits in the shaded grey squares. Similarly, let $Y$ denote the sum of all numbers in the shaded yellow squares on the upper left block (i.e. the $3 \times 3$ box outlined red towards the top left). Concatenate $X$ with $Y$ in that order, and write that down. [b]8 Across.[/b] For any $n \in N$ such that $1 < n < 10$, define the sequence $X_{n,1}$,$X_{n,2}$,$ ...$ by $X_{n,1} = n$, and for $r \ge 2$, X_{n,r} is smallest number $k \in N$ larger than X_{n,r-1} such that $k$ and the sum of digits of $k$ are both powers of $n$. For instance, $X_{3,1 = 3}$, $X_{3,2} = 9$, $X_{3,3} = 27$, and so on. Concatenate $X_{2,2}$ with $X_{2,4}$, and write down the answer. [b]9 Across.[/b] Find positive integers $x, y,z$ satisfying the following properties: $y$ is obtained by subtracting $93$ from $x$, and $z$ is obtained by subtracting $183$ from $y$, furthermore, $x, y$ and $z$ in their base-$10$ representations contain precisely all the digits from $1$ through $9$ once (i.e. concatenating $x, y$ and $z$ yields a valid $9$-digit Sudoku answer). Obviously, write down the concatenation of $x, y$ and $z$ in that order. [b]11 Across.[/b] Find the largest pair of two-digit consecutive prime numbers $a$ and $b$ (with $a < b$) such that the sum of the digits of a plus the sum of the digits of b is also a prime number. Write the concatenation of $a$ and $b$. [b]12 Across.[/b] Suppose you have a strip of $2n + 1$ squares, with n frogs on the $n$ squares on the left, and $n$ toads on the $n$ squares on the right. A move consists either of a toad or a frog sliding to an adjacent square if it is vacant, or of a toad or a frog jumping one square over another one and landing on the next square if it is vacant. For instance, the starting position [img]https://cdn.artofproblemsolving.com/attachments/a/a/6c97f15304449284dc282ff86014f526322e4a.png[/img] has the position [img]https://cdn.artofproblemsolving.com/attachments/e/6/e2c9520731bd94dc0aa37f540c2b9d1bce6432.png[/img] or the position [img]https://cdn.artofproblemsolving.com/attachments/3/f/06868eca80d649c4f80425dc9dc5c596cb2a4e.png[/img] as results of valid first moves. What is the minimum number of moves needed to swap the toads with the frogs if $n = 5$? How about $n = 6$? Concatenate your answers. [b]15 Across.[/b] Let $w$ be the largest number such that $w$, $2w$ and $3w$ together contain every digit from $1$ through $9$ exactly once. Let $x$ be the smallest integer with the property that its first $5$ multiples contain the digit $9$. A Leyland number is an integer of the form $m^n + n^m$ for integers $m, n > 1$. Let $y$ be the fourth Leyland number. A Pillai prime is a prime number $p$ for which there is an integer $n > 0$ such that $n! \equiv - 1 (mod \,\, p)$, but $p \not\equiv 1 (mod \,\, n)$. Let $z$ be the fourth Pillai prime. Concatenate $w$, $x, y$ and $z$ in that order to obtain a permutation of $1,..., 9$. Write down this permutation. [b]19 Across.[/b] A hoax number $k \in N$ is one for which the sum of its digits (in base $10$) equals the sum of the digits of its distinct prime factors (in base $10$). For instance, the distinct prime factors of $22$ are $2$ and $11$, and we have $2+2 = 2+(1+1)$. In fact, $22$ is the first hoax number. What is the second? [b]20 Across.[/b] Let $a, b$ and $c$ be distinct $2$-digit numbers satisfying the following properties: – $a$ is the largest integer expressible as $a = x^y = y^x$, for distinct integers $x$ and $y$. – $b$ is the smallest integer which has three partitions into three parts, which all give the same product (which turns out to be $1200$) when multiplied. – $c$ is the largest number that is the sum of the digits of its cube. Concatenate $a, b$ and $c$, and write down the resulting 6-digit prime number. [b]21 Across.[/b] Suppose $N = \underline{a}\, \underline{b} \, \underline{c} \, \underline{d}$ is a $4$-digit number with digits $a, b, c$ and $d$, such that $N = a \cdot b \cdot c \cdot d^7$. Find $N$. [b]22 Across.[/b] What is the smallest number expressible as the sum of $2, 3, 4$, or $5$ distinct primes? [b][u][i]Down [/i][/u][/b] [b]1 Down.[/b] For some $a, b, c \in N$, let the polynomial $$p(x) = x^5 - 252x^4 + ax^3 - bx^2 + cx - 62604360$$ have five distinct roots that are positive integers. Four of these are 2-digit numbers, while the last one is single-digit. Concatenate all five roots in decreasing order, and write down the result. [b]2 Down.[/b] Gene, Ashwath and Cosmin together have $2511$ math books. Gene now buys as many math books as he already has, and Cosmin sells off half his math books. This leaves them with $2919$ books in total. After this, Ashwath suddenly sells off all his books to buy a private jet, leaving Gene and Cosmin with a total of $2184$ books. How many books did Gene, Ashwath and Cosmin have to begin with? Concatenate the three answers (in the order Gene, Ashwath, Cosmin) and write down the result. [b]3 Down.[/b] A regular octahedron is a convex polyhedron composed of eight congruent faces, each of which is an equilateral triangle; four of them meet at each vertex. For instance, the following diagram depicts a regular octahedron: [img]https://cdn.artofproblemsolving.com/attachments/c/1/6a92f12d5e9f56b0699531ae8369a0ab8ab813.png[/img] Let $T$ be a regular octahedron of edge length $28$. What is the total surface area of $T$ , rounded to the nearest integer? [b]4 Down.[/b] Evaluate the value of the expression $$\sum^{T_{25}}_{k=T_{24}+1}k, $$ where $T_i$ denotes the $i^{th}$ triangular number (the sum of the integers from $1$ through $i$). [b]5 Down.[/b] Suppose $r$ and $s$ are consecutive multiples of$ 9$ satisfying the following properties: – $r$ is the smallest positive integer that can be written as the sum of $3$ positive squares in $3$ different ways. – $s$ is the smallest $2$-digit number that is a Woodall number as well as a base-$10$ Harshad number. A Woodall number is any number of the form $n \cdot 2^n - 1$ for some $n \in N$. A base-$10$ Harshad number is divisible by the sum of its digits in base $10$. Concatenate $r$ and $s$ and write down the result. [b]10 Down.[/b] For any $k \in N$, let $\phi_p(k)$ denote the sum of the distinct prime factors of $k$. Suppose $N$ is the largest integer less than $50000$ satisfying $\phi_p(N) =\phi_p(N + 1)$, where the common value turns out to be a meager $55$. What is$ N$? [b]13 Down.[/b] The $n^{th}$ $s$-gonal number $P(s, n)$ is defined as $$P(s, n) = (s - 3)T_{n-1} + T_n$$ where $T_i$ is the $i^{th}$ triangular number (recall that the $i^{th}$ triangular number is the sum of the numbers $1$ through $i$). Find the least $N$ such that $N$ is both a $34$-gonal number, and a $163$-gonal number. [b]14 Down.[/b] A biprime is a positive integer that is the product of precisely two (not necessarily distinct) primes. A cluster of biprimes is an ordered triple $(m,m + 1,m + 2)$ of consecutive integers that are biprimes. There are precisely three clusters of biprimes below 100. Denote these by, say, $$\{(p, p + 1, p + 2), (q, q + 1,q + 2), (r, r + 1, r + 2)\}$$ and add the condition that $p + 2 < q < r - 2$ to fix the three clusters. Interestingly, $p + 1$ and $q$ are both multiples of $17$. Concatenate $q$ with $p + 1$ in that order, and write down the result. [b]16 Down.[/b] Find the least positive integer $m$ (written in base $10$ as $m = \underline{a} \, \underline{b} \, \underline{c} $, with digits $a, b,c$), such that $m = (b + c)^a$. [b]17 Down.[/b] Let $X$ be a set containing $32$ elements, and let $Y\subseteq X$ be a subset containing $29$ elements. How many $2$-element subsets of $X$ are there which have nonempty intersection with $Y$? [b]18 Down.[/b] Find a positive integer $K < 196$, which is a strange twin of the number $196$, in the sense that $K^2$ shares the same digits as $196^2$, and $K^3$ shares the same digits as $196^3$. PS. You should use hide for answers.

Many states use a sequence of three letters followed by a sequence of three digits as their standard license-plate pattern. Given that each three-letter three-digit arrangement is equally likely, the probability that such a license plate will contain at least one palindrome (a three-letter arrangement or a three-digit arrangement that reads the same left-to-right as it does right-to-left) is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $n\ge 2$ be an integer and let $P(X)=X^n+a_{n-1}X^{n-1}+\ldots +a_1X+1$ be a polynomial with positive integer coefficients. Suppose that $a_k=a_{n-k}$ for all $k\in 1,2,\ldots,n-1$. Prove that there exist infinitely many pairs of positive integers $x,y$ such that $x|P(y)$ and $y|P(x)$. [i]Remus Nicoara[/i]

[b]p1.[/b] Jose,, Luciano, and Placido enjoy playing cards after their performances, and you are invited to deal. They use just nine cards, numbered from $2$ through $10$, and each player is to receive three cards. You hope to hand out the cards so that the following three conditions hold: A) When Jose and Luciano pick cards randomly from their piles, Luciano most often picks a card higher than Jose, B) When Luciano and Placido pick cards randomly from their piles, Placido most often picks a card higher than Luciano, C) When Placido and Jose pick cards randomly from their piles, Jose most often picks a card higher than Placido. Explain why it is impossible to distribute the nine cards so as to satisfy these three conditions, or give an example of one such distribution. [b]p2.[/b] Is it possible to fill a rectangular box with a finite number of solid cubes (two or more), each with a different edge length? Justify your answer. [b]p3.[/b] Two parallel lines pass through the points $(0, 1)$ and $(-1, 0)$. Two other lines are drawn through $(1, 0)$ and $(0, 0)$, each perpendicular to the ¯rst two. The two sets of lines intersect in four points that are the vertices of a square. Find all possible equations for the first two lines. [b]p4.[/b] Suppose $a_1, a_2, a_3,...$ is a sequence of integers that represent data to be transmitted across a communication channel. Engineers use the quantity $$G(n) =(1 - \sqrt3)a_n -(3 - \sqrt3)a_{n+1} +(3 + \sqrt3)a_{n+2}-(1+ \sqrt3)a_{n+3}$$ to detect noise in the signal. a. Show that if the numbers $a_1, a_2, a_3,...$ are in arithmetic progression, then $G(n) = 0$ for all $n = 1, 2, 3, ...$. b. Show that if $G(n) = 0$ for all $n = 1, 2, 3, ...$, then $a_1, a_2, a_3,...$ is an arithmetic progression. [b]p5.[/b] The Olive View Airline in the remote country of Kuklafrania has decided to use the following rule to establish its air routes: If $A$ and $B$ are two distinct cities, then there is to be an air route connecting $A$ with $B$ either if there is no city closer to $A$ than $B$ or if there is no city closer to $B$ than $A$. No further routes will be permitted. Distances between Kuklafranian cities are never equal. Prove that no city will be connected by air routes to more than ¯ve other cities. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We consider the set E of all fractions $\frac{1}{n}$, where $n$ is a natural number. A maximal arithmetic progression of length $k$ of the set E is an arithmetic progression of $k$ terms such that all its terms belong to the set E, and it is impossible to extend it to the right or to the left with another element of E. For example, $\frac{1}{20}, \frac{1}{8}, \frac{1}{5}$, is an arithmetic progression in E of length $3$, and it is maximal, since to extend it towards to the right you have to add $\frac{11}{40}$, which does not belong to E, and to extend it to the left you have to add $\frac{-1}{40}$ which does not belong to E either. Prove that for every integer $k&gt; 2$, there exists a maximal arithmetic progression of length $k$ of the set E.

What is the smallest value that the sum of the digits of the number $3n^2+n+1,$ $n\in\mathbb{N}$ can take?

Mark writes the expression $\sqrt{d}$ for each positive divisor $d$ of $8!$ on the board. Seeing that these expressions might not be worth points on HMMT, Rishabh simplifies each expression to the form $a \sqrt{b} $ where $a$ and $b$ are integers such that $b$ is not divisible by the square of a prime number. (For example, $\sqrt{20}$, $\sqrt{16}$, and $\sqrt{6}$ simplify to $2\sqrt5$, $4\sqrt1$, and $1\sqrt6$, respectively.) Compute the sum of $a+b$ across all expressions that Rishabh writes.

[b]p1.[/b] Find $20 \cdot 18 + 20 + 18 + 1$. [b]p2.[/b] Suzie’s Ice Cream has $10$ flavors of ice cream, $5$ types of cones, and $5$ toppings to choose from. An ice cream cone consists of one flavor, one cone, and one topping. How many ways are there for Sebastian to order an ice cream cone from Suzie’s? [b]p3.[/b] Let $a = 7$ and $b = 77$. Find $\frac{(2ab)^2}{(a+b)^2-(a-b)^2}$ . [b]p4.[/b] Sebastian invests $100,000$ dollars. On the first day, the value of his investment falls by $20$ percent. On the second day, it increases by $25$ percent. On the third day, it falls by $25$ percent. On the fourth day, it increases by $60$ percent. How many dollars is his investment worth by the end of the fourth day? [b]p5.[/b] Square $ABCD$ has side length $5$. Points $K,L,M,N$ are on segments $AB$,$BC$,$CD$,$DA$ respectively,such that $MC = CL = 2$ and $NA = AK = 1$. The area of trapezoid $KLMN$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p6.[/b] Suppose that $p$ and $q$ are prime numbers. If $p + q = 30$, find the sum of all possible values of $pq$. [b]p7.[/b] Tori receives a $15 - 20 - 25$ right triangle. She cuts the triangle into two pieces along the altitude to the side of length $25$. What is the difference between the areas of the two pieces? [b]p8.[/b] The factorial of a positive integer $n$, denoted $n!$, is the product of all the positive integers less than or equal to $n$. For example, $1! = 1$ and $5! = 120$. Let $m!$ and $n!$ be the smallest and largest factorial ending in exactly $3$ zeroes, respectively. Find $m + n$. [b]p9.[/b] Sam is late to class, which is located at point $B$. He begins his walk at point $A$ and is only allowed to walk on the grid lines. He wants to get to his destination quickly; how many paths are there that minimize his walking distance? [img]https://cdn.artofproblemsolving.com/attachments/a/5/764e64ac315c950367357a1a8658b08abd635b.png[/img] [b]p10.[/b] Mr. Iyer owns a set of $6$ antique marbles, where $1$ is red, $2$ are yellow, and $3$ are blue. Unfortunately, he has randomly lost two of the marbles. His granddaughter starts drawing the remaining $4$ out of a bag without replacement. She draws a yellow marble, then the red marble. Suppose that the probability that the next marble she draws is blue is equal to $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positiveintegers. What is $m + n$? [b]p11.[/b] If $a$ is a positive integer, what is the largest integer that will always be a factor of $(a^3+1)(a^3+2)(a^3+3)$? [b]p12.[/b] What is the largest prime number that is a factor of $160,401$? [b]p13.[/b] For how many integers $m$ does the equation $x^2 + mx + 2018 = 0$ have no real solutions in $x$? [b]p14.[/b] What is the largest palindrome that can be expressed as the product of two two-digit numbers? A palindrome is a positive integer that has the same value when its digits are reversed. An example of a palindrome is $7887887$. [b]p15.[/b] In circle $\omega$ inscribe quadrilateral $ADBC$ such that $AB \perp CD$. Let $E$ be the intersection of diagonals $AB$ and $CD$, and suppose that $EC = 3$, $ED = 4$, and $EB = 2$. If the radius of $\omega$ is $r$, then $r^2 =\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Determine $m + n$. [b]p16.[/b] Suppose that $a, b, c$ are nonzero real numbers such that $2a^2 + 5b^2 + 45c^2 = 4ab + 6bc + 12ca$. Find the value of $\frac{9(a + b + c)^3}{5abc}$ . [b]p17.[/b] Call a positive integer n spicy if there exist n distinct integers $k_1, k_2, ... , k_n$ such that the following two conditions hold: $\bullet$ $|k_1| + |k_2| +... + |k_n| = n2$, $\bullet$ $k_1 + k_2 + ...+ k_n = 0$. Determine the number of spicy integers less than $10^6$. [b]p18.[/b] Consider the system of equations $$|x^2 - y^2 - 4x + 4y| = 4$$ $$|x^2 + y^2 - 4x - 4y| = 4.$$ Find the sum of all $x$ and $y$ that satisfy the system. [b]p19.[/b] Determine the number of $8$ letter sequences, consisting only of the letters $W,Q,N$, in which none of the sequences $WW$, $QQQ$, or $NNNN$ appear. For example, $WQQNNNQQ$ is a valid sequence, while $WWWQNQNQ$ is not. [b]p20.[/b] Triangle $\vartriangle ABC$ has $AB = 7$, $CA = 8$, and $BC = 9$. Let the reflections of $A,B,C$ over the orthocenter H be $A'$,$B'$,$C'$. The area of the intersection of triangles $ABC$ and $A'B'C'$ can be expressed in the form $\frac{a\sqrt{b}}{c}$ , where $b$ is squarefree and $a$ and $c$ are relatively prime. determine $a+b+c$. (The orthocenter of a triangle is the intersection of its three altitudes.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Alexander and Louise are a pair of burglars. Every morning, Louise steals one third of Alexander's money, but feels remorse later in the afternoon and gives him half of all the money she has. If Louise has no money at the beginning and starts stealing on the first day, what is the least positive integer amount of money Alexander must have so that at the end of the 2012th day they both have an integer amount of money?

A set of $2003$ positive integers is given. Show that one can find two elements such that their sum is not a divisor of the sum of the other elements.

suppose that $v(x)=\sum_{p\le x,p\in \mathbb P}log(p)$ (here $\mathbb P$ denotes the set of all positive prime numbers). prove that the two statements below are equivalent: [b]a)[/b] $v(x) \sim x$ when $x \longrightarrow \infty$ [b]b)[/b] $\pi (x) \sim \frac{x}{ln(x)}$ when $x \longrightarrow \infty$. (here $\pi (x)$ is number of the prime numbers less than or equal to $x$).

Find all pairs of natural numbers $(m, n)$ for which $2^m3^n +1$ is the square of some integer.

Find all integers that can be written in the form $\frac{1}{a_1}+\frac{2}{a_2}+...+\frac{9}{a_9}$ where $a_1,a_2, ...,a_9$ are nonzero digits, not necessarily different.

Let $p$ a prime number and $d$ a divisor of $p-1$. Find the product of elements in $\mathbb Z_p$ with order $d$. ($\mod p$). (10 points)

Let $m,n$ be co-prime integers, such that $m$ is even and $n$ is odd. Prove that the following expression does not depend on the values of $m$ and $n$: \[ \frac 1{2n} + \sum^{n-1}_{k=1} (-1)^{\left[ \frac{mk}n \right]} \left\{ \frac {mk}n \right\} . \] [i]Bogdan Enescu[/i]

[b]p1.[/b] Find the unknown angle $a$ of the triangle inscribed in the square. [img]https://cdn.artofproblemsolving.com/attachments/b/1/4aab5079dea41637f2fa22851984f886f034df.png[/img] [b]p2.[/b] Draw a polygon in the plane and a point outside of it with the following property: no edge of the polygon is completely visible from that point (in other words, the view is obstructed by some other edge). [b]p3.[/b] This problem has two parts. In each part, $2022$ real numbers are given, with some additional property. (a) Suppose that the sum of any three of the given numbers is an integer. Show that the total sum of the $2022$ numbers is also an integer. (b) Suppose that the sum of any five of the given numbers is an integer. Show that 5 times the total sum of the $2022$ numbers is also an integer, but the sum itself is not necessarily an integer. [b]p4.[/b] Replace stars with digits so that the long multiplication in the example below is correct. [img]https://cdn.artofproblemsolving.com/attachments/9/7/229315886b5f122dc0675f6d578624e83fc4e0.png[/img] [b]p5.[/b] Five nodes of a square grid paper are marked (called marked points). Show that there are at least two marked points such that the middle point of the interval connecting them is also a node of the square grid paper [b]p6.[/b] Solve the system $$\begin{cases} \dfrac{xy}{x+y}=\dfrac{8}{3} \\ \dfrac{yz}{y+z}=\dfrac{12}{5} \\\dfrac{xz}{x+z}=\dfrac{24}{7} \end{cases}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Solve $p^n+144=m^2$ where $m,n\in \mathbb{N}$ and $p$ is a prime number.

Find all positive integers $ a$ and $ b$ for which \[ \left \lfloor \frac{a^2}{b} \right \rfloor \plus{} \left \lfloor \frac{b^2}{a} \right \rfloor \equal{} \left \lfloor \frac{a^2 \plus{} b^2}{ab} \right \rfloor \plus{} ab.\]

$(GBR 1)$ The polynomial $P(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$, where $a_0,\cdots, a_k$ are integers, is said to be divisible by an integer $m$ if $P(x)$ is a multiple of $m$ for every integral value of $x$. Show that if $P(x)$ is divisible by $m$, then $a_0 \cdot k!$ is a multiple of $m$. Also prove that if $a, k,m$ are positive integers such that $ak!$ is a multiple of $m$, then a polynomial $P(x)$ with leading term $ax^k$can be found that is divisible by $m.$

Solve in natural the equation $9^x-3^x=y^4+2y^3+y^2+2y$ _____________________________ Azerbaijan Land of the Fire :lol:

Call a positive integer [i]prime-simple[/i] if it can be expressed as the sum of the squares of two distinct prime numbers. How many positive integers less than or equal to $100$ are prime-simple?