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


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


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