Search by Topic

Filter by: Content type:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There is 1 result

Broad Topics > Advanced Algebra > Transpositions

problem icon


Stage: 5 Challenge Level: Challenge Level:2 Challenge Level:2

To draw lots each player chooses a different upright, the paper is then unrolled, the paths charted and the results declared. Prove that no two paths ever end up at the foot of the same upright?