Do there exist $100$ positive integers such that their sum is equal to their least common multiple? (S Tokarev)

[b]p1.[/b] You are on a flat planet. There are $100$ cities at points $x = 1, ..., 100$ along the line $y = -1$, and another $100$ cities at points $x = 1, ... , 100$ along the line $y = 1$. The planet’s terrain is scalding hot, and you cannot walk over it directly. Instead, you must cross archways from city to city. There are archways between all pairs of cities with different $y$ coordinates, but no other pairs: for instance, there is an archway from $(1, -1)$ to $(50, 1)$, but not from $(1, -1)$ to $(50, -1)$. The amount of “effort” necessary to cross an archway equals the square of the distance between the cities it connects. You are at $(1, -1)$, and you want to get to $(100, -1)$. What is the least amount of effort this journey can take? [b]p2.[/b] Let $f(x) = x^4 + ax^3 + bx^2 + cx + 25$. Suppose $a, b, c$ are integers and $f(x)$ has $4$ distinct integer roots. Find $f(3)$. [b]p3.[/b] Frankenstein starts at the point $(0, 0, 0)$ and walks to the point $(3, 3, 3)$. At each step he walks either one unit in the positive $x$-direction, one unit in the positive $y$-direction, or one unit in the positive $z$-direction. How many distinct paths can Frankenstein take to reach his destination? [b]p4.[/b] Let $ABCD$ be a rectangle with $AB = 20$, $BC = 15$. Let $X$ and $Y$ be on the diagonal $\overline{BD}$ of $ABCD$ such that $BX > BY$ . Suppose $A$ and $X$ are two vertices of a square which has two sides on lines $\overline{AB}$ and $\overline{AD}$, and suppose that $C$ and $Y$ are vertices of a square which has sides on $\overline{CB}$ and $\overline{CD}$. Find the length $XY$ . [img]https://cdn.artofproblemsolving.com/attachments/2/8/a3f7706171ff3c93389ff80a45886e306476d1.png[/img] [b]p5.[/b] $n \ge 2$ kids are trick-or-treating. They enter a haunted house in a single-file line such that each kid is friends with precisely the kids (or kid) adjacent to him. Inside the haunted house, they get mixed up and out of order. They meet up again at the exit, and leave in single file. After leaving, they realize that each kid (except the first to leave) is friends with at least one kid who left before him. In how many possible orders could they have left the haunted house? [b]p6.[/b] Call a set $S$ sparse if every pair of distinct elements of S differ by more than $1$. Find the number of sparse subsets (possibly empty) of $\{1, 2,... , 10\}$. [b]p7.[/b] How many ordered triples of integers $(a, b, c)$ are there such that $1 \le a, b, c \le 70$ and $a^2 + b^2 + c^2$ is divisible by $28$? [b]p8.[/b] Let $C_1$, $C_2$ be circles with centers $O_1$, $O_2$, respectively. Line $\ell$ is an external tangent to $C_1$ and $C_2$, it touches $C_1$ at $A$ and $C_2$ at $B$. Line segment $\overline{O_1O_2}$ meets $C_1$ at $X$. Let $C$ be the circle through $A, X, B$ with center $O$. Let $\overline{OO_1}$ and $\overline{OO_2}$ intersect circle $C$ at $D$ and $E$, respectively. Suppose the radii of $C_1$ and $C_2$ are $16$ and $9$, respectively, and suppose the area of the quadrilateral $O_1O_2BA$ is $300$. Find the length of segment $DE$. [b]p9.[/b] What is the remainder when $5^{5^{5^5}}$ is divided by $13$? [b]p10.[/b] Let $\alpha$ and $\beta$ be the smallest and largest real numbers satisfying $$x^2 = 13 + \lfloor x \rfloor + \left\lfloor \frac{x}{2} \right\rfloor +\left\lfloor \frac{x}{3} \right\rfloor + \left\lfloor \frac{x}{4} \right\rfloor .$$ Find $\beta - \alpha$ . ($\lfloor a \rfloor$ is defined as the largest integer that is not larger than $a$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Eight poles stand along the road. A sparrow starts at the first pole and once in a minute flies to a neighboring pole. Let $a(n)$ be the number of ways to reach the last pole in $2n + 1$ flights (we assume $a(m) = 0$ for $m < 3$). Prove that for all $n \ge 4$ $$a(n) - 7a(n-1)+ 15a(n-2) - 10a(n-3) +a(n-4)=0.$$ [i](T. Amdeberhan, F. Petrov )[/i]

Integers $a, b, c$ satisfy $a+b-c=1$ and $a^2+b^2-c^2=-1$. What is the sum of all possible values of $a^2+b^2+c^2$ ?

Let $k$ be a positive integer and $a_1,a_2,\dots$ be an infinite sequence of positive integers such that \[a_ia_{i+1} \mid k-a_i^2\] for all integers $i \ge 1$. Prove that there exists a positive integer $M$ such that $a_n=a_{n+1}$ for all integers $n \ge M$.

Prove that there is no natural number n such that the sum of all the digits of the number m, where $m = n(2n-1)$ is equal to $2000$.

Consider a finite set of points, $\Phi$, in the $\mathbb{R}^2$, such that they follow the following properties : [list] [*] $\Phi$ doesn't contain the origin $\{(0,0)\}$ and not all points are collinear. [*] If $\alpha \in \Phi$, then $-\alpha \in \Phi$, $c\alpha \notin \Phi $ for $c\neq 1$ or $-1$ [*] If $\alpha, \ \beta$ are in $\Phi$, then the reflection of $\beta$ in the line passing through the origin and perpendicular to the line containing origin and $\alpha$ is in $\Phi$ [*] If $\alpha = (a,b) , \ \beta = (c,d)$, (both $\alpha, \ \beta \in \Phi$) then $\frac{2(ac+bd)}{c^2+d^2} \in \mathbb{Z}$ [/list] Prove that there cannot be 5 collinear points in $\Phi$

Determine the integers $n, n \ge 2$, with the property that the numbers $1! , 2 ! , 3 ! , ..., (n- 1)!$ give different remainders when dividing by $n $.

For $m\in \mathbb{N}$ define $m?$ be the product of first $m$ primes. Determine if there exists positive integers $m,n$ with the following property : \[ m?=n(n+1)(n+2)(n+3) \] [i]Proposed by Matko Ljulj[/i]

[b]p1.[/b] The following number is the product of the divisors of $n$. $$2^63^3$$ What is $n$? [b]p2.[/b] Let a right triangle have the sides $AB =\sqrt3$, $BC =\sqrt2$, and $CA = 1$. Let $D$ be a point such that $AD = BD = 1$. Let $E$ be the point on line $BD$ that is equidistant from $D$ and $A$. Find the angle $\angle AEB$. [b]p3.[/b] There are twelve indistinguishable blackboards that are distributed to eight different schools. There must be at least one board for each school. How many ways are there of distributing the boards? [b]p4.[/b] A Nishop is a chess piece that moves like a knight on its first turn, like a bishop on its second turn, and in general like a knight on odd-numbered turns and like a bishop on even-numbered turns. A Nishop starts in the bottom-left square of a $3\times 3$-chessboard. How many ways can it travel to touch each square of the chessboard exactly once? [b]p5.[/b] Let a Fibonacci Spiral be a spiral constructed by the addition of quarter-circles of radius $n$, where each $n$ is a term of the Fibonacci series: $$1, 1, 2, 3, 5, 8,...$$ (Each term in this series is the sum of the two terms that precede it.) What is the arclength of the maximum Fibonacci spiral that can be enclosed in a rectangle of area $714$, whose side lengths are terms in the Fibonacci series? [b]p6.[/b] Suppose that $a_1 = 1$ and $$a_{n+1} = a_n -\frac{2}{n + 2}+\frac{4}{n + 1}-\frac{2}{n}$$ What is $a_{15}$? [b]p7.[/b] Consider $5$ points in the plane, no three of which are collinear. Let $n$ be the number of circles that can be drawn through at least three of the points. What are the possible values of $n$? [b]p8.[/b] Find the number of positive integers $n$ satisfying $\lfloor n /2014 \rfloor =\lfloor n/2016 \rfloor$. [b]p9.[/b] Let $f$ be a function taking real numbers to real numbers such that for all reals $x \ne 0, 1$, we have $$f(x) + f \left( \frac{1}{1 - x}\right)= (2x - 1)^2 + f\left( 1 -\frac{1}{ x}\right)$$ Compute $f(3)$. [b]p10.[/b] Alice and Bob split $5$ beans into piles. They take turns removing a positive number of beans from a pile of their choice. The player to take the last bean loses. Alice plays first. How many ways are there to split the piles such that Alice has a winning strategy? [b]p11.[/b] Triangle $ABC$ is an equilateral triangle of side length $1$. Let point $M$ be the midpoint of side $AC$. Another equilateral triangle $DEF$, also of side length $1$, is drawn such that the circumcenter of $DEF$ is $M$, point $D$ rests on side $AB$. The length of $AD$ is of the form $\frac{a+\sqrt{b}}{c}$ , where $b$ is square free. What is $a + b + c$? [b]p12.[/b] Consider the function $f(x) = \max \{-11x- 37, x - 1, 9x + 3\}$ defined for all real $x$. Let $p(x)$ be a quadratic polynomial tangent to the graph of $f$ at three distinct points with x values $t_1$, $t_2$ and $t_3$ Compute the maximum value of $t_1 + t_2 + t_3$ over all possible $p$. [b]p13.[/b] Circle $J_1$ of radius $77$ is centered at point $X$ and circle $J_2$ of radius $39$ is centered at point $Y$. Point $A$ lies on $J1$ and on line $XY$ , such that A and Y are on opposite sides of $X$. $\Omega$ is the unique circle simultaneously tangent to the tangent segments from point $A$ to $J_2$ and internally tangent to $J_1$. If $XY = 157$, what is the radius of $\Omega$ ? [b]p14.[/b] Find the smallest positive integer $n$ so that for any integers $a_1, a_2,..., a_{527}$,the number $$\left( \prod^{527}_{j=1} a_j\right) \cdot\left( \sum^{527}_{j=1} a^n_j\right)$$ is divisible by $527$. [b]p15.[/b] A circle $\Omega$ of unit radius is inscribed in the quadrilateral $ABCD$. Let circle $\omega_A$ be the unique circle of radius $r_A$ externally tangent to $\Omega$, and also tangent to segments $AB$ and $DA$. Similarly define circles $\omega_B$, $\omega_C$, and $\omega_D$ and radii $r_B$, $r_C$, and $r_D$. Compute the smallest positive real $\lambda$ so that $r_C < \lambda$ over all such configurations with $r_A > r_B > r_C > r_D$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $f:\mathbb N\to \mathbb N$. Show that $f(m)+n\mid f(n)+m$ for all positive integers $m\le n$ if and only if $f(m)+n\mid f(n)+m$ for all positive integers $m\ge n$. [i]Proposed by Carl Schildkraut[/i]

Given the equation $$ a^b\cdot b^c=c^a $$ in positive integers $a$, $b$, and $c$. [i](i)[/i] Prove that any prime divisor of $a$ divides $b$ as well. [i](ii)[/i] Solve the equation under the assumption $b\ge a$. [i](iii)[/i] Prove that the equation has infinitely many solutions. [i](I. Voronovich)[/i]

Let $d_1,d_2,\ldots,d_k$ be all factors of a positive integer $n$ including $1$ and $n$. If $d_1+d_2+\ldots+d_k=72$ then $\frac1{d_1}+\frac1{d_2}+\ldots+\frac1{d_k}$ is $\textbf{(A)}~\frac{k^2}{72}$ $\textbf{(B)}~\frac{72}k$ $\textbf{(C)}~\frac{72}n$ $\textbf{(D)}~\text{None of the above}$

How many ordered triples $(a, b, c)$ of positive integers are there such that none of $a, b, c$ exceeds $2010$ and each of $a, b, c$ divides $a + b + c$?

An eight-digit number is said to be 'robust' if it meets both of the following conditions: (i) None of its digits is $0$. (ii) The difference between two consecutive digits is $4$ or $5$. Answer the following questions: (a) How many are robust numbers? (b) A robust number is said to be 'super robust' if all of its digits are distinct. Calculate the sum of all the super robust numbers.

Let $k$ be a positive integer. Define $u_0 = 0, u_1 = 1$, and $u_n=ku_{n-1}-u_{n-2} , n \geq 2.$ Show that for each integer $n$, the number $u_1^3 + u_2^3 +\cdots+ u_n^3 $ is a multiple of $u_1 + u_2 +\cdots+ u_n.$

Let $a,b,c$ be distinct positive integers and let $r,s,t$ be positive integers such that: $ab+1=r^2,ac+1=s^2,bc+1=t^2$ Prove that it is not possible that all three fractions$ \frac{rt}{s}, \frac{rs}{t}, \frac{st}{r}$ are integers.

The positive integers \( a \) and \( b \) are coprime and such that there exist positive integers \( m_2 \) and \( m_5 \) for which \( am_2 + b \) is a perfect square of a positive integer, and \( am_5 + b \) is a perfect fifth power of a positive integer. Does there always exist a positive integer \( n \) for which \( an + b \) is a perfect \( k \)-th power of a positive integer, if: a) \( k = 7 \); b) \( k = 10 \)?

Find the number of pairs $(a, b)$ of positive integers with the property that the greatest common divisor of $a$ and $ b$ is equal to $1\cdot 2 \cdot 3\cdot ... \cdot50$, and the least common multiple of $a$ and $ b$ is $1^2 \cdot 2^2 \cdot 3^2\cdot ... \cdot 50^2$.

Fix a set of integers $S$. An integer is [i]clean[/i] if it is the sum of distinct elements of $S$ in exactly one way, and [i]dirty[/i] otherwise. Prove that the set of dirty numbers is either empty or infinite. [i]Note:[/i] We consider the empty sum to equal \(0\). [i]Proposed by Tony Wang and Ethan Tan[/i]

For any set $A=\{a_1,a_2,\cdots,a_m\}$, let $P(A)=a_1a_2\cdots a_m$. Let $n={2010\choose99}$, and let $A_1, A_2,\cdots,A_n$ be all $99$-element subsets of $\{1,2,\cdots,2010\}$. Prove that $2010|\sum^{n}_{i=1}P(A_i)$.

For a positive integer $n$, let $S(n)$ be the sum of its decimal digits. Determine the smallest positive integer $n$ for which $4 \cdot S(n)=3 \cdot S(2n)$.

How many four digit numbers $\overline{abcd}$ simultaneously satisfy the equalities $a+b=c+d$ and $a^2+b^2=c^2+d^2$?

Let $p>5$ be a prime. Suppose that there exist integer $k$ such that $ k^2 + 5 $ is divisible by $p$. Prove that there exist two positive integers $m,n$ satisfying $ p^2 = m^2 + 5n^2 $.

Farmer Boso has a busy farm with lots of animals. He tends to $5b$ cows, $5a +7$ chickens, and $b^{a-5}$ insects. Note that each insect has $6$ legs. The number of cows is equal to the number of insects. The total number of legs present amongst his animals can be expressed as $\overline{LLL }+1$, where $L$ stands for a digit. Find $L$.