# Puzzles

## Archive

Show me a Random Puzzle**Most Recent Collections**

#### Advent Calendar 2017

#### Sunday Afternoon Maths LXII

What's the Star?#### Sunday Afternoon Maths LXI

XYZ#### Sunday Afternoon Maths LX

Where is Evariste?Bending a Straw

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 rectangles clocks menace routes taxicab geometry remainders chalkdust crossnumber palindromes sequences means unit fractions division square roots surds doubling quadratics indices planes volume number partitions ave pascal's triangle mean advent symmetry arrows addition cube numbers star numbers perfect numbers## 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?