If the integer nnn is neither a multiple of 2 nor a multiple of 5, prove that nnn must be able to divide a number composed entirely of the digit 1.
Let SSS be a set of 777 integers taken from {1,2,…,15}\{1, 2, \dots, 15\}{1,2,…,15} with the property that if aaa and bbb are elements of SSS with a<ba<ba<b, then bbb is not a multiple of aaa. What is the least possible value of an element in SSS?
Find the smallest number nnn such that given any nnn distinct numbers from {1,2,3,…,999}\{1, 2, 3, \ldots, 999\}{1,2,3,…,999}, one can choose four different numbers a,b,c,da, b, c, da,b,c,d such that a+2b+3c=da + 2b + 3c = da+2b+3c=d.
Show that for every positive integer nnn, there exists a nonzero multiple of nnn that has at most nnn digits, all of which are either 0 or 1.
A group of children are arranged into two equal rows. Every child in the back row is taller than the child standing in front of him in the other row. Prove that this remains true if each row is rearranged so that the children increase in he…
Show that for any integers aaa, bbb, ccc, not all zero, and such that ∣a∣,∣b∣,∣c∣<106|a|, |b|, |c| < 10^6∣a∣,∣b∣,∣c∣<106, we have ∣a+b2+c3∣>10−21|a + b \sqrt{2} + c \sqrt{3}| > 10^{-21}∣a+b2+c3. However, show that we can find such aaa, bbb, ccc with…
The nnn points P1,P2,…,PnP_{1}, P_{2}, \ldots, P_{n}P1,P2,…,Pn are placed inside or on the boundary of a disk of radius 1 in such a way that the minimum distance dnd_{n}dn between any two of these points has its largest possible value DnD_{n}Dn.…
Inside a square with side length 2, there are seven polygons each with an area of at least 1. Prove that there exist two polygons such that the area of their intersection is at least 17\frac{1}{7}71.
Let LLL be a subset in the coordinate plane defined by L={(41x+2y,59x+15y)∣x,y∈Z}L = \{(41x + 2y, 59x + 15y) | x, y \in \mathbb Z \}L={(41x+2y,59x+15y)∣x,y∈Z} , where Z\mathbb ZZ is set of integers. Prove that for any parallelogram with center in the origin of coordinate and area…
Prove that for any positive integers a,b,c,a, b, c,a,b,c, and ddd, the integer (a−b)(a−c)(a−d)(b−c)(b−d)(c−d)(a-b)(a-c)(a-d)(b-c)(b-d)(c-d)(a−b)(a−c)(a−d)(b−c)(b−d)(c−d) is divisible by 12.
Let n≥3n\geq 3n≥3 be an integer and let S⊂{1,2,…,n3}\mathcal{S} \subset \{1,2,\ldots, n^3\}S⊂{1,2,…,n3} be a set with 3n23n^23n2 elements. Prove that there exist nine distinct numbers a1,a2,…,a9∈Sa_1,a_2,\ldots,a_9 \in \mathcal{S}a1,a2,…,a9∈ such that the following system h…
On a grid, we have marked nnn lattice points. Let's call a segment defined by these points "good" if its midpoint is also a lattice point. What is the minimum number of "good" segments?
What is the smallest k such that any subset of {1, 2, ... , 50} with k elements must have two distinct elements m, n such that m + n divides mn?
Given six grid points pi(xi,yi)p_{i}(x_{i}, y_{i})pi(xi,yi) for i=1,2,3,4,5,6i = 1, 2, 3, 4, 5, 6i=1,2,3,4,5,6 such that: (1) ∣xi∣≤2|x_{i}| \leq 2∣xi∣≤2 and ∣yi∣≤2|y_{i}| \leq 2∣yi∣≤2 for i=1,2,3,4,5,6i = 1, 2, 3, 4, 5, 6i=1,2,3,4,5,6; (2) No three points are collinear. Prove that among all triangles w…
Find the smallest positive integer nnn such that we can write numbers 1,2,…,n1,2,\dots ,n1,2,…,n in a 18*18 board such that: i)each number appears at least once ii)In each row or column,there are no two numbers having difference 0 or 1
Let M={1,2,⋯ ,20}M = \{1, 2, \cdots, 20\}M={1,2,⋯,20}. For any 9-element subset SSS of MMM, the function f(S)f(S)f(S) takes an integer value from 1 to 20. Prove that no matter how the function fff is defined, there exists a 10-element subset TTT…
a) What is the maximum number of bishops that can be placed on a 1000 by 1000 board so that they do not attack each other? b) What is the maximum number of knights that can be placed on an 8 by 8 board so that they do not attack each othe…
Given a natural number K>2K > 2K>2 and a set of NNN cards, each with a positive number written on it. It turns out that it is possible to select some of these cards (possibly just one) with a sum of numbers equal to KKK, some cards…
Show that among the participants of the Animath training this week, there are two who know the same number of other participants (assuming the "knowing each other" relationship is symmetric).
The network of bus routes in the city of Lisse is arranged such that: a) each route has three stops; b) any two routes either do not share any stops or share exactly one common stop. What is the maximum number of routes that can exist in th…