Problems

Age
Difficulty
Found: 2011

Let \(u\) and \(v\) be two positive integers, with \(u>v\). Prove that a triangle with side lengths \(u^2-v^2\), \(2uv\) and \(u^2+v^2\) is right-angled.

We call a triple of natural numbers (also known as positive integers) \((a,b,c)\) satisfying \(a^2+b^2=c^2\) a Pythagorean triple. If, further, \(a\), \(b\) and \(c\) are relatively prime, then we say that \((a,b,c)\) is a primitive Pythagorean triple.

Show that every primitive Pythagorean triple can be written in the form \((u^2-v^2,2uv,u^2+v^2)\) for some coprime positive integers \(u>v\).

What symmetries does a regular hexagon have, and how many?

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\).

Given a pile of five cards, is it true that reversing the order of the pile by counting the cards out one by one leaves no card in its original position?

Today we will discover some ideas related to non-isosceles triangles, this particular restriction comes from the fact that in isosceles triangles a median and a height coincide.

With a pile of four cards, does reversing the order of the pile by counting the cards out one by one leaves no card in its original position?

You have in your hands a royal flush! That is, Ace, King, Queen, Jack and \(10\) of spades. How many shuffles of your hand swap the Ace and Jack?

You have a row of coins and you can perform these three operations as many times as you like:

  1. Remove three adjacent heads

  2. Remove two adjacent tails

  3. If there’s a head between two tails, then you can remove the head and swap the two tails to 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.