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 

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

Sunday Afternoon Maths LXVI

Cryptic crossnumber #2

Sunday Afternoon Maths LXV

Cryptic crossnumber #1
Breaking Chocolate
Square and cube endings

List of all puzzles


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


Show me a random puzzle
▼ show ▼
© Matthew Scroggs 2019