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 

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

Sunday Afternoon Maths LXVI

Cryptic crossnumber #2

Sunday Afternoon Maths LXV

Cryptic crossnumber #1
Breaking Chocolate
Square and cube endings

List of all puzzles


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


Show me a random puzzle
▼ show ▼
© Matthew Scroggs 2019