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


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


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