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


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


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