Let \(X\) be a finite set, and let \(\mathcal{P}X\) be the power set of \(X\) - that is, the set of subsets of \(X\). For subsets \(A\) and \(B\) of \(X\), define \(A*B\) as the symmetric difference of \(A\) and \(B\) - that is, those elements that are in either \(A\) or \(B\), but not both. In formal set theory notation, this is \(A*B=(A\cup B)\backslash(A\cap B)\).
Prove that \((\mathcal{P}X,*)\) forms a group.
The lengths of three sides of a right-angled triangle are all integers.
Show that one of them is divisible by \(5\).
You have a row of coins and you can perform these three operations as many times as you like:
Remove three adjacent heads
Remove two adjacent tails
If there’s a tail followed by a heads, then turn the tail over and put a new tail after both heads
You apply these operations until you can’t make any more moves. Show that you will always get the same configuration at the end, no matter the order.
Let \(a\) be a positive integer, and let \(p\) be a prime number. Prove that \(a^p - a\) is a multiple of \(p\).
Find all functions \(f\) from the real numbers to the real numbers such that \(xy=f(x)f(y)-f(x+y)\) for all real numbers x and y.
There are two imposters and seven crewmates on the rocket ‘Plus’. How many ways are there for the nine people to split into three groups of three, such that each group has at least two crewmates? The two imposters and seven crewmates are all distinguishable from each other, but we’re not concerned with the order of the three groups.
For example: \(\{I_1,C_1,C_2\}\), \(\{I_2,C_3,C_4\}\) and \(\{C_5,C_6,C_7\}\) is the same as \(\{C_3,C_4,I_2\}\), \(\{C_5,C_6,C_7\}\) and \(\{I_1,C_2,C_1\}\) but different from \(\{I_2,C_1,C_2\}\), \(\{I_1,C_3,C_4\}\) and \(\{C_5,C_6,C_7\}\).
Let \(\sigma(n)\) be the sum of the divisors of \(n\). For example, \(\sigma(12)=1+2+3+4+6+12=28\). We use \(\gamma\) to denote the Euler-Mascheroni constant - one way to define this is as \(\gamma:=\lim_{n\to\infty}(\sum_{k=1}^n\frac{1}{n}-\log n)\).
Prove that \(\sigma(n)<e^{\gamma}n\log\log n\) for all integers \(n>5040\).
Let \(n\) be an integer bigger than \(1\), and \(p\) a prime number. Suppose that \(n\) divides \(p-1\) and \(p\) divides \(n^3-1\). Prove that \(4p-3\) is a square number.
Let \(n\) be a composite number. Arrange the factors of \(n\) greater than \(1\) in a circle. When can this be done such that neighbours in the circle are never coprime?
Let \(x\), \(y\), \(z\) and \(w\) be non-negative integers. Find all solutions to \(2^x3^y-5^z7^w=1\).