Found problems: 155
On a $1000\times 1000$-board we put dominoes, in such a way that each domino covers exactly two squares on the board. Moreover, two dominoes are not allowed to be adjacent, but are allowed to touch in a vertex.
Determine the maximum number of dominoes that we can put on the board in this way.
[i]Attention: you have to really prove that a greater number of dominoes is impossible. [/i]
On a stormy night ten guests came to dinner party and left their shoes outside the room in order to keep the carpet clean. After the dinner there was a blackout, and the gusts leaving one by one, put on at random, any pair of shoes big enough for their feet. (Each pair of shoes stays together). Any guest who could not find a pair big enough spent the night there. What is the largest number of guests who might have had to spend the night there?
Every two of the $n$ cities of Ruritania are connected by a direct flight of one from two airlines. Promonopoly Committee wants at least $k$ flights performed by one company. To do this, he can at least every day to choose any three cities and change the ownership of the three flights connecting these cities each other (that is, to take each of these flights from a company that performs it, and pass the other). What is the largest $k$ committee knowingly will be able to achieve its goal in no time, no matter how the flights are distributed hour?
For which natural number $k$ does $\frac{k^2}{1.001^k}$ attain its maximum value?
Consider the set $A = \{1, 2, ..., n\}$. For each integer $k$, let $r_k$ be the largest quantity of different elements of $A$ that we can choose so that the difference between two numbers chosen is always different from $k$. Determine the highest value possible of $r_k$, where $1 \le k \le \frac{n}{2}$
In a triangle with integer side lengths, one side is three times as long as a second side, and the length of the third side is $17$. What is the greatest possible perimeter of the triangle?
Let the sum of positive numbers $x_1, x_2, ... , x_n$ be $1$. Let $s$ be the greatest of the numbers $$\left\{\frac{x_1}{1+x_1}, \frac{x_2}{1+x_1+x_2}, ..., \frac{x_n}{1+x_1+...+x_n}\right\}$$
What is the minimal possible $s$? What $x_i $correspond it?
16 students took part in a competition. All problems were multiple choice style. Each problem had four choices. It was said that any two students had at most one answer in common, find the maximum number of problems.
Let $p = 1+\frac{1}{2}+\frac{1}{2^2}+\frac{1}{2^3}+\frac{1}{2^4}+\frac{1}{2^5}. $ For nonnegative reals $x, y,z$ satisfying $(x-1)^2 + (y-1)^2 + (z-1)^2 = 27,$ find the maximum value of $x^p + y^p + z^p.$
In a triangle with integer side lengths, one side is three times as long as a second side, and the length of the third side is $17$. What is the greatest possible perimeter of the triangle?
From the set of numbers $1 , 2, 3, . . . , 1985$ choose the largest subset such that the difference between any two numbers in the subset is not a prime number (the prime numbers are $2, 3 , 5 , 7,... , 1$ is not a prime number) .
Let $ABC$ be an equilateral triangle of side $1$, $D$ be a point on $BC$, and $r_1, r_2$ be the inradii of triangles $ABD$ and $ADC$. Express $r_1r_2$ in terms of $p = BD$ and find the maximum of $r_1r_2$.
Each of the numbers $1$ up to and including $2014$ has to be coloured; half of them have to be coloured red the other half blue. Then you consider the number $k$ of positive integers that are expressible as the sum of a red and a blue number. Determine the maximum value of $k$ that can be obtained.
* What is the radius of the largest possible circle inscribed into a cube with side $a$?
Let \[ f(x_1,x_2,x_3,x_4,x_5,x_6,x_7)=x_1x_2x_4+x_2x_3x_5+x_3x_4x_6+x_4x_5x_7+x_5x_6x_1+x_6x_7x_2+x_7x_1x_3 \] be defined for non-negative real numbers $x_1,x_2,\dots,x_7$ with sum $1$.
Prove that $f(x_1,x_2,\dots,x_7)$ has a maximum value and find that value.
A natural number $k$ is such that $k^2 < 2014 < (k +1)^2$. What is the largest prime factor of $k$?
Consider $7$-gons inscribed in a circle such that all sides of the $7$-gon are of different length. Determine the maximal number of $120^\circ$ angles in this kind of a $7$-gon.
The goal of this problem is to show that the maximum area of a polygon with a fixed number of sides and a fixed perimeter is achieved by a regular polygon.
(a) Prove that the polygon with maximum area must be convex. (Hint: If any angle is concave, show that the polygon’s area can be increased.)
(b) Prove that if two adjacent sides have different lengths, the area of the polygon can be increased without changing the perimeter.
(c) Prove that the polygon with maximum area is equilateral, that is, has all the same side lengths.
It is true that when given all four side lengths in order of a quadrilateral, the maximum area is achieved in the unique configuration in which the quadrilateral is cyclic, that is, it can be inscribed in a circle.
(d) Prove that in an equilateral polygon, if any two adjacent angles are different then the area of the polygon
can be increased without changing the perimeter.
(e) Prove that the polygon of maximum area must be equiangular, or have all angles equal.
(f ) Prove that the polygon of maximum area is a regular polygon.
PS. You had better use hide for answers.
1 - Prove that $55 < (1+\sqrt{3})^4 < 56$ .
2 - Find the largest power of $2$ that divides $\lceil(1+\sqrt{3})^{2n}\rceil$ for the positive integer $n$
A [i]trio [/i] is a set of three distinct integers such that two of the numbers are divisors or multiples of the third. Which [i]trio [/i] contained in $\{1, 2, ... , 2002\}$ has the largest possible sum? Find all [i]trios [/i] with the maximum sum.
Let $A,B,C$ be nodes of the lattice $Z\times Z$ such that inside the triangle $ABC$ lies a unique node $P$ of the lattice. Denote $E = AP \cap BC$. Determine max $\frac{AP}{PE}$ , over all such configurations.
(a) Determine the maximum $M$ of $x+y +z$ where $x, y$ and $z$ are positive real numbers with $16xyz = (x + y)^2(x + z)^2$.
(b) Prove the existence of infinitely many triples $(x, y, z)$ of positive rational numbers that satisfy $16xyz = (x + y)^2(x + z)^2$ and $x + y + z = M$.
Proposed by Karl Czakler
Let $a$ and $b$ be positive integers not divisible by $5$. A sequence of integers is constructed as follows: the first term is $5$, and every consequent term is obtained by multiplying its precedent by $a$ and adding $b$. (For example, if $a = 2$ and $b = 4$, the first three terms are $5,14,32$.) What is the maximum possible number of primes that can occur before encoutering the first composite term?
To each element of the set $S = \{1,2,... ,1000\}$ a colour is assigned. Suppose that for any two elements $a, b$ of $S$, if $15$ divides $a + b$ then they are both assigned the same colour. What is the maximum possible number of distinct colours used?
On an infinite sheet of graph paper a table is drawn so that in each square of the table stands a number equal to the arithmetic mean of the four adjacent numbers. Out of the table a piece is cut along the lines of the graph paper. Prove that the largest number on the piece always occurs at an edge, where $x = \frac14 (a + b + c + d)$.