# Puzzles

## 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?

If you enjoyed this puzzle, check out Sunday Afternoon Maths XXVIII,

puzzles about numbers, or a random puzzle.

puzzles about numbers, or a random puzzle.