Jamie’s drawer is pretty big. It has infinitely many crayons. In fact, for every colour of crayon, there are infinitely many crayons of that colour.
In every group of \(9\) randomly chosen crayons from Jamie’s drawer, some \(3\) will have the same colour. Jamie chooses \(25\) crayons at random. Prove that some \(7\) of them will have the same colour.
Suppose \(n \ge 2\) cricket teams play in a tournament. No two teams play each other more than once, and no team plays itself. Prove that some two teams have to play the same number of games.
An ice cream machine distributes ice cream randomly. There are 5 flavours in the machine and you would like to have one of the available flavours at least 3 times, although you don’t mind which flavour it is. How many samples do you need to obtain in total to ensure that?
Prove that among \(11\) different infinite decimal fractions, you can choose two fractions which coincide in an infinite number of digits.
A convex polygon on the plane contains at least \(m^2+1\) points with integer coordinates. Prove that it contains \(m+1\) points with integers coordinates that lie on the same line.
Suppose a football team scores at least one goal in each of the \(20\) consecutive games. If it scores a total of \(30\) goals in those \(20\) games, prove that in some sequence of consecutive games it scores exactly \(9\) goals total.
The prime factorization of the number \(b\) is \(2 \times 5^2 \times 7 \times 13^2 \times 17\). The prime factorization of the number \(c\) is \(2^2 \times 5 \times 7^2 \times 13\). Is the first number divisible by the second one? Is the product of these two numbers, \(b \times c\), divisible by \(49000\)?
Find all the prime numbers \(p\) such that there exist natural numbers \(x\) and \(y\) for which \(p^x = y^3 + 1\).
Determine all prime numbers \(p\) such that \(5p+1\) is also prime.
A natural number \(p\) is called prime if the only natural divisors of \(p\) are \(1\) and \(p\). Prime numbers are building blocks of all the natural numbers in the sense of the The Fundamental Theorem of Arithmetic: for a positive integer \(n\) there exists a unique prime factorization (or prime decomposition) \[n = p_1^{a_1}p_2^{a_2}...p_r^{a_r}.\] Today we will explore how unusual prime numbers are.
Essentially there is only one way to write an integer number as a product of prime numbers, where some of the prime numbers in the product can appear multiple times.