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


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


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