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


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


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