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


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


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