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


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


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