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


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


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