One million [i]bucks [/i] (i.e. one million male deer) are in different cells of a $1000 \times 1000$ grid. The left and right edges of the grid are then glued together, and the top and bottom edges of the grid are glued together, so that the grid forms a doughnut-shaped torus. Furthermore, some of the bucks are [i]honest bucks[/i], who always tell the truth, and the remaining bucks are [i]dishonest bucks[/i], who never tell the truth. Each of the million [i]bucks [/i] claims that “at most one of my neighboring bucks is an [i]honest buck[/i].” A pair of [i]neighboring bucks[/i] is said to be [i]buckaroo[/i] if exactly one of them is an [i]honest buck[/i] . What is the minimum possible number of [i]buckaroo [/i] pairs in the grid? Note: Two [i]bucks [/i] are considered to be [i]neighboring [/i] if their cells $(x_1, y_1)$ and $(x_2, y_2)$ satisfy either: $x_1 = x_2$ and $y_1 - y_2 \equiv \pm1$ (mod $1000$), or $x_1 - x_2 \equiv \pm 1$ (mod $1000$) and $y_1 = y_2$.

$\sqrt{\frac{1}{9} + \frac{1}{16}} =$ $\textbf{(A)}\ \frac15 \qquad \textbf{(B)}\ \frac14 \qquad \textbf{(C)}\ \frac27 \qquad \textbf{(D)}\ \frac{5}{12} \qquad \textbf{(E)}\ \frac{7}{12}$

[b]7.1 / 6.3[/b] All integers from 1 to 1966 are written on the board. Allowed is to erase any two numbers by writing their difference instead. Prove that repeating such an operation many times cannot ensure that There are only zeros left on the board. [b]7.2 [/b] Prove that the radius of a circle is equal to the difference between the lengths of two chords, one of which subtends an arc of $1/10$ of a circle, and the other subtends an arc in $3/10$ of a circle. [b]7.3[/b] Prove that for any natural number $n$ the number $ n(2n+1)(3n+1)...(1966n + 1) $ is divisible by every prime number less than $1966$. [b]7.4[/b] What number needs to be put in place * so that the next the problem had a unique solution: [i]“There are n straight lines on the plane, intersecting at * points. Find n.” ?[/i] [b]7.5 / 6.4[/b] Black paint was sprayed onto a white surface. Prove that there are three points of the same color lying on the same line, and so, that one of the points lies in the middle between the other two. [b]7.6 [/b] There are $n$ points on the plane so that any triangle with vertices at these points has an area less than $1$. Prove that all these points can be enclosed in a triangle of area $4$. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988082_1966_leningrad_math_olympiad]here[/url].

Inside an $11\times 11$ square, Pablo drew a rectangle and extending its sides divided the square into $5$ rectangles, as shown in the figure. [img]https://cdn.artofproblemsolving.com/attachments/5/a/7774da7085f283b3aae74fb5ff472572571827.gif[/img] Sofía did the same, but she also managed to make the lengths of the sides of the $5$ rectangles be whole numbers between $1$ and $10$, all different. Show a figure like the one Sofia made.

How many lattice points $(v, w, x, y, z)$ does a $5$-sphere centered on the origin, with radius $3$, contain on its surface or in its interior?

Consider $\vartriangle ABC$ right at $B, F$ a point such that $B - F - C$ and $AF$ bisects $\angle BAC$, $I$ a point such that $A - I - F$ and CI bisect $\angle ACB$, and $E$ a point such that $A- E - C$ and $AF \perp EI$. If $AB = 4$ and $\frac{AI}{IF}={4}{3}$ , determine $AE$. Notation: $A-B-C$ means than points $A,B,C$ are collinear in that order i.e. $ B$ lies between $ A$ and $C$.

Peter and Basil take turns drawing roads on a plane, Peter starts. The road is either horizontal or a vertical line along which one can drive in only one direction (that direction is determined when the road is drawn). Can Basil always act in such a way that after each of his moves one could drive according to the rules between any two constructed crossroads, regardless of Peter's actions? Alexandr Perepechko

Let p>3 be a prime and k>0 an integer. Find the multiplicity of X-1 in the factorization of $ f(X)= X^{p^k-1}+X^{p^k-2}+\cdots+X+1$ modulo p; in other words, find the unique non-negative integer r such that $ (X - 1)^r $ divides f(X) \modulo p, but$ (X - 1)^{r+1} $does not divide f(X) \modulo p.

For any natural number $ m, \quad\lim_{n\to\infty } n^{1+m} \int_{0}^1 e^{-nx}\ln \left( 1+x^m \right) dx =m! . $ [i]Gheorghe Iurea[/i]

$A_1A_2A_3A_4A_5A_6A_7A_8$ is a regular octagon. Let $P$ be a point inside the octagon such that the distances from $P$ to $A_1A_2, A_2A_3$ and $A_3A_4$ are $24, 26$ and $27$ respectively. The length of $A_1A_2$ can be written as $a \sqrt{b} -c$, where $a,b$ and $c$ are positive integers and $b$ is not divisible by any square number other than $1$. What is the value of $(a+b+c)$?

In certain country, the coins have the following values: $2^0, 2^1, 2^2,\dots 2^{10}$. A cash machine has $1000$ coins of each value and give the money using each coin(of each value) at most once. The customers order all the positive integers: $1,2,3,4,5,\dots$ (in this order) in coins. a) Determine the first integer, such that the cash machine cannot provide. b) In the moment that the first customer can not be attended, by the lack of coins, what are the coins which are not available in the cash machine?

Let $\Omega$ be a circle with radius $18$ and let $\mathcal{S}$ be the region inside $\Omega$ that the centroid of $\triangle XYZ$ sweeps through as $X$ varies along all possible points lying outside of $\Omega$, $Y$ varies along all possible points lying on $\Omega$ and $XZ$ is tangent to the circle. Compute the greatest integer less than or equal to the area of $\mathcal{S}$. [I]Proposed by [b]FedeX333X[/b][/I]

[i]Version 1[/i]. Let $n$ be a positive integer, and set $N=2^{n}$. Determine the smallest real number $a_{n}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant a_{n}(x-1)^{2}+x . \] [i]Version 2[/i]. For every positive integer $N$, determine the smallest real number $b_{N}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant b_{N}(x-1)^{2}+x . \]

Does there exist a finite set $A$ of positive integers of at least two elements and an infinite set $B$ of positive integers, such that any two distinct elements in $A+B$ are coprime, and for any coprime positive integers $m,n$, there exists an element $x$ in $A+B$ satisfying $x\equiv n \pmod m$ ? Here $A+B=\{a+b|a\in A, b\in B\}$.

Let $ABC$ to be an acute triangle. Also, let $K$ and $L$ to be the two intersections of the perpendicular from $B$ with respect to side $AC$ with the circle of diameter $AC$, with $K$ closer to $B$ than $L$. Analogously, $X$ and $Y$ are the two intersections of the perpendicular from $C$ with respect to side $AB$ with the circle of diamter $AB$, with $X$ closer to $C$ than $Y$. Prove that the intersection of $XL$ and $KY$ lies on $BC$.

Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ that are coprime to $n$. Compute \[\sum_{n=1}^{\infty}\frac{\phi(n)}{5^n+1}.\]