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 2020

Advent calendar 2019

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

List of all puzzles


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


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