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.
Josie and Kevin are each thinking of a two digit positive integer. Josie’s number is twice as big as Kevin’s. One digit of Kevin’s number is equal to the sum of digits of Josie’s number. The other digit of Kevin’s number is equal to the difference between the digits of Josie’s number. What is the sum of Kevin and Josie’s 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.
When we write \(137\) in decimal, we mean \(1 \times 10^2 + 3 \times 10 + 7 \times 1\). If we write it instead using powers of \(2\), we have \(137 = 1 \times 2^7 + 0 \times 2^6 + 0 \times 2^5 + 0 \times 2^4 + 1 \times 2^3 + 0 \times 2^2 + 0 \times 2^1 + 1 \times 2^0\). To tell apart binary representation from decimals, we can use the following notation: \(137 = (10001001)_2\).
What is the number \(273\) in binary? Note that using binary is useful for finding whether a particular Nim game is a winning position or a losing position.
Is it possible to construct a 485 × 6 table with the integers from 1 to 2910 such that the sum of the 6 numbers in each row is constant, and the sum of the 485 numbers in each column is also constant?
You meet an alien, who you learn is thinking of a positive integer \(n\). They ask the following three questions.
“Am I the kind who could ask whether \(n\) is divisible by no primes other than \(2\) or \(3\)?"
“Am I the kind who could ask whether the sum of the divisors of \(n\) (including \(1\) and \(n\) themselves) is at least twice \(n\)?"
“Is \(n\) divisible by 3?"
Is this alien a Crick or a Goop?
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\)?