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


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


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