[b]6.1 [/b] The bindery had 92 sheets of white paper and $135$ sheets of colored paper. It took a sheet of white paper to bind each book. and a sheet of colored paper. After binding several books of white Paper turned out to be half as much as the colored one. How many books were bound? [b]6.2[/b] Prove that if you multiply all the integers from $1$ to $1965$, you get the number, the last whose non-zero digit is even. [b]6.3[/b] The front tires of a car wear out after $25,000$ kilometers, and the rear tires after $15,000$ kilometers of travel. When should you swap tires so that they wear out at the same time? [b]6.4[/b] A rectangle $19$ cm $\times 65$ cm is divided by straight lines parallel to its sides into squares with side 1 cm. How many parts will this rectangle be divided into if you also draw a diagonal in it? [b]6.5[/b] Find the dividend, divisor and quotient in the example: [center][img]https://cdn.artofproblemsolving.com/attachments/2/e/de053e7e11e712305a89d3b9e78ac0901dc775.png[/img] [/center] [b]6.6[/b] Odd numbers from $1$ to $49$ are written out in table form $$\,\,\,1\,\,\,\,\,\, 3\,\,\,\,\,\, 5\,\,\,\,\,\, 7\,\,\,\,\,\, 9$$ $$11\,\,\, 13\,\,\, 15\,\,\, 17\,\,\, 19$$ $$21\,\,\, 23\,\,\, 25\,\,\, 27\,\,\, 29$$ $$31\,\,\, 33\,\,\, 35\,\,\, 37\,\,\, 39$$ $$41\,\,\, 43\,\,\, 45\,\,\, 47\,\,\, 49$$ $5$ numbers are selected, any two of which are not on the same line or in one column. What is their sum? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988081_1965_leningrad_math_olympiad]here[/url].

Solve the equation: $$x \cdot 2^{\dfrac{1}{x}}+\dfrac{1}{x} \cdot 2^x=4$$

Let $ABC$ be an acute triangle and $T$ be a point interior to this triangle. that $\angle ATB = \angle BTC = \angle CTA$. Let $M,N$ and $P$ be the feet of the perpendiculars from $T$ to $BC$, $CA$ and $AB$ respectively. Prove that if the circle circumscribed around $\vartriangle MNP$ cuts again the sides $ BC$, $CA$ and $AB$ in $M_1$, $N_1$, $P_1$ respectively, then the $\vartriangle M_1N_1P_1$ It is equilateral.

Ebeneezer is painting the edges of a cube. He wants to paint the edges so that the colored edges form a loop that does not intersect itself. For example, the loop should not look like a “figure eight” shape. If two colorings are considered equivalent if there is a rotation of the cubes so that the colored edges are the same, what is the number of possible edge colorings?

Let $ABC$ be an acute angled triangle with circumcircle $O$. Line $AO$ intersects the circumcircle of triangle $ABC$ again at point $D$. Let $P$ be a point on the side $BC$. Line passing through $P$ perpendicular to $AP$ intersects lines $DB$ and $DC$ at $E$ and $F$ respectively . Line passing through $D$ perpendicular to $BC$ intersects $EF$ at point $Q$. Prove that $EQ = FQ$ if and only if $BP = CP$.

Define the sequence $(a_n)_{n=1}^\infty$ of positive integers by $a_1=1$ and the condition that $a_{n+1}$ is the least integer such that \[\mathrm{lcm}(a_1, a_2, \ldots, a_{n+1})>\mathrm{lcm}(a_1, a_2, \ldots, a_n)\mbox{.}\] Determine the set of elements of $(a_n)$.

There are given $111$ coins and a $n\times n$ table divided into unit cells. This coins are placed inside the unit cells (one unit cell may contain one coin, many coins, or may be empty), such that the difference between the number of coins from two neighbouring cells (that have a common edge) is $1$. Find the maximal $n$ for this to be possible.

A $4\times4\times4$ cube is composed of $64$ unit cubes. The faces of $16$ unit cubes are to be coloured red. A colouring is called interesting if there is exactly $1$ red unit cube in every $1\times1\times 4$ rectangular box composed of $4$ unit cubes. Determine the number of interesting colourings.

In a sports meeting a total of $m$ medals were awarded over $n$ days. On the first day one medal and $\frac{1}{7}$ of the remaining medals were awarded. On the second day two medals and $\frac{1}{7}$ of the remaining medals were awarded, and so on. On the last day, the remaining $n$ medals were awarded. How many medals did the meeting last, and what was the total number of medals ?

A square $S_a$ is inscribed in an acute-angled triangle $ABC$ with two vertices on side $BC$ and one on each of sides $AC$ and $AB$. Squares $S_b$ and $S_c$ are analogously inscribed in the triangle. For which triangles are the squares $S_a,S_b$, and $S_c$ congruent?

here is the most difficult and the most beautiful problem occurs in 21th iranian (2003) olympiad assume that P is n-gon ,lying on the plane ,we name its edge 1,2,..,n. if S=s1,s2,s3,.... be a finite or infinite sequence such that for each i, si is in {1,2,...,n}, we move P on the plane according to the S in this form: at first we reflect P through the s1 ( s1 means the edge which iys number is s1)then through s2 and so on like the figure below. a)show that there exist the infinite sequence S sucth that if we move P according to S we cover all the plane b)prove that the sequence in a) isn't periodic. c)assume that P is regular pentagon ,which the radius of its circumcircle is 1,and D is circle ,with radius 1.00001 ,arbitrarily in the plane .does exist a sequence S such that we move P according to S then P reside in D completely?

A large urn contains $100$ balls, of which $36\%$ are red and the rest are blue. How many of the blue balls must be removed so that the percentage of red balls in the urn will be $72\%?$ (No red balls are to be removed.) $ \textbf{(A) }28 \qquad \textbf{(B) }32 \qquad \textbf{(C) }36 \qquad \textbf{(D) }50 \qquad \textbf{(E) }64 \qquad $

$S=\{1,2, \ldots, 6\} .$ Then find out the number of unordered pairs of $(A, B)$ such that $A, B \subseteq S$ and $A \cap B=\phi$ [list=1] [*] 360 [*] 364 [*] 365 [*] 366 [/list]

The triangle $ABC$ is isosceles and has a right angle at the vertex $A$. Construct all points that simultaneously satisfy the following two conditions: (i) are equidistant from points $A$ and $B$ (ii) heve distance exactly three times from point $C$ as far as from point $B$.

In each square of an $11\times 11$ board, we are to write one of the numbers $-1$, $0$, or $1$ in such a way that the sum of the numbers in each column is nonnegative and the sum of the numbers in each row is nonpositive. What is the smallest number of zeros that can be written on the board? Justify your answer.

A jacket was originally priced $\textdollar 100$. The price was reduced by $10\%$ three times and increased by $10\%$ four times in some order. To the nearest cent, what was the final price?

For $n \ge 1$ call a finite sequence $(a_1, a_2 \ldots a_n)$ of positive integers [i]progressive[/i] if $a_i < a_{i+1}$ and $a_i$ divides $a_{i+1}$ for all $1 \le i \le n-1$. Find the number of progressive sequences such that the sum of the terms in the sequence is equal to $360$.

Find all the real $a,b,c$ such that the equality $$|ax+by+cz| + |bx+cy+az| + |cx+ay+bz| = |x|+|y|+|z|$$ is valid for all the real $x,y,z$.

Let $x=\sqrt{37-20\sqrt{3}}$. Find the value of $\frac{x^4-9x^3+5x^2-7x+68}{x^2-10x+19}$

Define $ \phi$ the positive real root of $ x^2 \minus{} x \minus{} 1$ and let $ a,b,c,d$ be positive real numbers such that $ (a \plus{} 2b)^2 \equal{} 4c^2 \plus{} 1$. Show that $ \displaystyle 2d^2 \plus{} a^2\left(\phi \minus{} \frac {1}{2}\right) \plus{} b^2\left(\frac {1}{\phi \minus{} 1} \plus{} 2\right) \plus{} 2 \ge 4(c \minus{} d) \plus{} 2\sqrt {d^2 \plus{} 2d}$ and find all cases of equality. [i](A.Naskov)[/i]

Given a positive integer $n$, an $n$-gun is a $2n$-mino that is formed by putting a $1 \times n$ grid and an $n \times 1$ grid side by side so that one of the corner unit squares of the first grid is next to one of the corner unit squares of the second grid. Find the minimum possible $k$ such that it is possible to color the infinite planar grid with $k$ colors such that any $n$-gun cannot cover two different squares with the same color. [i]Itf0501[/i]

Let $N = 123456789101112\dots4344$ be the $79$-digit number obtained that is formed by writing the integers from $1$ to $44$ in order, one after the other. What is the remainder when $N$ is divided by $45$? $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 18 \qquad\textbf{(E)}\ 44$

On a straight line lie $100$ points and another point outside the line. Which is the biggest the number of isosceles triangles can be formed from the vertices of these $101$ points?

You place $n^2$ indistinguishable pieces on an $n\times n$ chessboard, where $n=2^{90}\approx 1.27\times10^{27}$. Of these pieces, $n$ of them are slightly lighter than usual, while the rest are all the same standard weight, but you are unable to discern this simply by feeling the pieces.\\ However, beneath each row and column of the chessboard, you have set up a scale, which, when turned on, will tell you [i]only[/i] whether the average weight of all the pieces on that row or column is the standard weight, or lighter than standard. On a given step, you are allowed to rearrange every piece on the chessboard, and then turn on all the scales simultaneously, and record their outputs, before turning them all off again. (Note that you can only turn on the scales if all $n^2$ pieces are placed in different squares on the board.) Find an algorithm that, in at most $k$ steps, will always allow you to rearrange the pieces in such a way that every row and column measures lighter than standard on the final step. An algorithm that completes in at most $k$ steps will be awarded: 1 pt for $k>10^{55}$ 10 pts for $k=10^{55}$ 30 pts for $k=10^{30}$ 50 pts for $k=10^{28}$ 65 pts for $k=10^{20}$ 80 pts for $k=10^5$ 90 pts for $k=2021$ 100 pts for $k=500$

Given $2018 \times 4$ grids and tint them with red and blue. So that each row and each column has the same number of red and blue grids, respectively. Suppose there're $M$ ways to tint the grids with the mentioned requirement. Determine $M \pmod {2018}$.