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?

Show answer & extension


Show me a random puzzle
 Most recent collections 

Advent calendar 2019

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

Sunday Afternoon Maths LXVI

Cryptic crossnumber #2

List of all puzzles


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


Show me a random puzzle
▼ show ▼
© Matthew Scroggs 2012–2020