1.1.9 · D4Arithmetic & Number Systems

Exercises — Prime factorization — factor trees, ladder method

1,784 words8 min readBack to topic

Level 1 — Recognition

Recall Solution E1

A prime is a natural number whose only divisors are and itself.

  • — has just one divisor, so it is a unit, not prime.
  • — divisors only → prime.
  • → composite.
  • — test (, stop at ): odd, digit-sum not divisible by prime.
  • → composite.
  • — test (): odd, digit-sum prime.
  • (digit-sum ) → composite.

Primes:

Recall Solution E2

, so the box is . Leaves are .


Level 2 — Application

Recall Solution E3

Always divide by the smallest prime that fits, top to bottom.

 2 | 180
 2 |  90
 3 |  45
 3 |  15
 5 |   5
   |   1
  • even → ÷2 = ; still even → ÷2 = . Now odd, stop dividing by .
  • : digit-sum → ÷3 = → ÷3 = . Then ÷5 = .
Recall Solution E4
 3 | 1155
 5 |  385
 7 |   77
11 |   11
   |    1
  • is odd (skip ). Digit-sum → ÷3 = .
  • ends in → ÷5 = .
  • → ÷7 = , ÷11 = .
Recall Solution E5

Halve repeatedly: — that is eight halvings.


Level 3 — Analysis

Recall Solution E6

Multiply the left-column primes: , i.e. Using the Number of Divisors rule :

Recall Solution E7

We need the exponent-plus-one factors to multiply to . List the ways to write as a product, subtract from each factor to get exponents, and put the biggest exponent on the smallest prime (that keeps the number small).

factorisation of exponents number

The smallest is , with . ✅

Recall Solution E8

Divisible by means . Divisor count .

  • . Gives .
  • . Gives .
  • give , neither divides → rejected.

Answers: or


Level 4 — Synthesis

Recall Solution E9

From E3 and E4: , and . Line the primes up (missing prime = exponent ):

prime in in min (HCF) max (LCM)

Check: , and ✅ (See HCF and LCM.)

Recall Solution E10

Cancel the shared primes (that's exactly the HCF, from E9): , so is fully reduced. (See Simplifying Fractions.)

Recall Solution E11

The identity gives Sanity check with primes: , . Min exponents ✅; max ✅.


Level 5 — Mastery

Recall Solution E12

A trailing zero is one factor of . So the number of trailing zeros is the number of paired s and s, i.e. . Count of s , count of s . Two trailing zeros. (Indeed ends in .)

Recall Solution E13

A perfect square has every prime exponent even (a square pairs each atom with a twin). Factorize:

 2 | 720   2 | 360   2 | 180   2 | 90   3 | 45   3 | 15   5 | 5   | 1

Exponents: (even ✅), (even ✅), (odd ✗). Only the is unpaired, so multiply by one more :

Recall Solution E14

A perfect cube needs every exponent to be a multiple of (each atom appears in triples). From , push each exponent up to the next multiple of :

  • : , need .
  • : , need .
  • : , need . Check: . ✅

Recall check

Recall Quick self-quiz (reveal)

Smallest number with exactly 12 divisors? ::: . HCF and LCM of and ? ::: , . in lowest terms? ::: . Trailing zeros of ? ::: . Smallest making a perfect square? ::: . Smallest making a perfect cube? ::: .

For the visual origin of these factor trees and ladders, revisit the parent Prime factorization — factor trees, ladder method; for the underlying uniqueness that makes every answer above the only answer, see Fundamental Theorem of Arithmetic. To generate primes to test with, Sieve of Eratosthenes is your workshop.