mscroggs.co.uk
mscroggs.co.uk

subscribe

Puzzles

3n+1

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

Archive

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

Tags

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

Archive

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