Prove for any natural number \(n\) that \((n + 1)(n + 2). . .(2n)\) is divisible by \(2^n\).
How many integers less than \(2025\) are divisible by \(18\) or \(21\), but not both?
Determine all prime numbers \(p\) such that \(p^2-6\) and \(p^2+6\) are both prime numbers.
Is it possible to place a positive integer in every cell of a \(10\times10\) array in such a way that both the following conditions are satisfied?
Each number (not in the bottom row) is a proper divisor of the number immediately below.
The numbers in each row, rearrange if necessary, form a sequence of 10 consecutive numbers.
Rational numbers \(x,y,z\) are such that all the numbers \(x+y^2+z^2\), \(x^2+y+z^2\), \(x^2+y^2+z\) are integers. Prove that \(2x\) is also an integer.
There is a very, very fast way of computing the greatest common divisor of two positive integers. It was in fact known even to the Greeks two thousand years ago. This procedure is called the Euclidean algorithm, named after Euclid, a famous ancient Greek mathematician.
The algorithm works as follows. Take two positive integers \(a,b\). Let’s say \(a\geq b\).
Calculate the remainder of \(a\) when divided by \(b\). Call it \(r_1\).
Calculate the remainder of \(b\) when divided by \(r_1\). Call it \(r_2\).
Calculate the remainder of \(r_1\) when divided by \(r_2\). Call it \(r_3\).
Continue to divide the remainder from two steps prior by the remainder from the last step, until...
The remainder \(r_n\) is divisible by \(r_{n+1}\). The Euclidean algorithm stops now and \(r_{n+1}\) is \(\gcd(a,b)\).
Show that there is indeed some natural number \(n\) such that \(r_n\) is divisible by \(r_{n+1}\), so that the Euclidean algorithm must stop eventually. Furthermore, show that \(r_{n+1}\) is actually \(\gcd(a,b)\) (otherwise it is all in vain!).
Let \(m\) and \(n\) be positive integers. What positive integers can be written as \(m+n+\gcd(m,n)+\text{lcm}(m,n)\), for some \(m\) and \(n\)?
Suppose that \(p\) is a prime number. How many numbers are there less than \(p^2\) that are relatively prime to \(p^2\)?
Suppose that \(n\) is a natural number and \(p\) is a prime number. How many numbers are there less than \(p^n\) that are relatively prime to \(p^n\)?
What time is it going to be in \(2025\) hours from now?