# Puzzles

## Archive

Show me a random puzzle**Most recent collections**

#### Advent calendar 2018

#### Sunday Afternoon Maths LXVI

Cryptic crossnumber #2#### Sunday Afternoon Maths LXV

Cryptic crossnumber #1Breaking Chocolate

Square and cube endings

#### Sunday Afternoon Maths LXIV

Equal lengthsDigitless factor

Backwards fours

List of all puzzles

## Tags

time geometry 2d shapes 3d shapes numbers spheres trigonometry complex numbers algebra lines graphs coordinates odd numbers fractions differentiation calculus folding tube maps ellipses triangle numbers money bases triangles squares area square numbers chess probability circles averages speed sport multiples dates factors parabolas functions logic cards games people maths shape prime numbers irreducible numbers probabilty angles proportion dice integration sum to infinity dodecagons hexagons multiplication factorials coins shapes regular shapes colouring grids floors integers rugby crosswords percentages digits sums christmas square roots surds doubling quadratics indices symmetry arrows addition cube numbers star numbers rectangles chocolate cryptic clues cryptic crossnumbers crossnumbers wordplay clocks menace routes taxicab geometry remainders chalkdust crossnumber palindromes sequences means unit fractions division planes volume number partitions ave pascal's triangle mean advent perfect numbers polygons books perimeter## 3n+1

Let \(S=\{3n+1:n\in\mathbb{N}\}\) be the set of numbers one more than a multiple of three.

**(i)**Show that \(S\) is closed under multiplication.

ie. Show that if \(a,b\in S\) then \(a\times b\in S\).

Let \(p\in S\) be irreducible if \(p\not=1\) and the only factors of \(p\) in \(S\) are \(1\) and \(p\). (This is equivalent to the most commonly given definition of prime.)

**(ii)**Can each number in \(S\) be uniquely factorised into irreducibles?