Numbers
Fractions and percentages, powers and roots, divisibility — how numbers are written and what they are built from.
Topics in this branch
Branch formulas
Branch: Numbers
Fractions
A fraction
numerator over denominator, b ≠ 0
Equivalent fractions
expanding: multiply both numerator and denominator by the same k
Adding fractions
bring both to a common denominator first
Multiplying fractions
multiply the numerators, multiply the denominators
Reducing a fraction
gcd = greatest common divisor — divide numerator and denominator by it
Decimals
Place value
the digits after the point are tenths, hundredths, thousandths
A fraction as a decimal
when the denominator expands to a power of 10
Adding decimals
line up the decimal points, then add like whole numbers
Multiplying decimals
multiply like whole numbers, place the point at the end
Rounding to hundredths
look at the first digit you drop — here 5, so it rounds up
Percentages
Percentage notation
a percentage is a hundredth of a whole
Percentage of a number
how much p percent of the whole c is
Whole from a known part
given the part and its percentage, recover the whole
Percentage change
positive is an increase, negative is a decrease
Powers
Definition of a power
a is the base, n is the exponent
Multiplying powers with the same base
add the exponents
Dividing powers with the same base
subtract the exponents
A power of a power
multiply the exponents
A power of a product
raise each factor separately
Zero and negative exponents
a negative exponent means a reciprocal
Roots
Square root
the inverse of squaring
Cube root
defined for negative numbers too
Product of roots
multiply under a single radical
Quotient of roots
the same law for division
Taking a factor out of a radical
a square leaves the radical as its base
Rationalising a denominator
multiply top and bottom by the same root
GCD and LCM
Divisibility
a divides b when b is a multiple of a
Greatest common divisor
the largest number dividing both
Lowest common multiple
the smallest positive number both divide
The identity tying GCD to LCM
know one and you can compute the other
Euclidean algorithm
repeat until the remainder is zero
Prime numbers
Definition of a prime
its only divisors are 1 and itself
Fundamental theorem of arithmetic
the prime factorisation is unique
Primality test
divisors up to the square root are enough
GCD and LCM from factorisations
lowest exponents for the GCD, highest for the LCM
