devices
light_mode
dark_mode
pin

Number

Types of Numbers

Numbers can be grouped into different categories based on their properties. This helps us create definitions and rules for how different types of numbers behave. For example, we can define the factors of NN as pairs of integers that produce NN when multiplied together.

Categories

  • real
    • numbers that can be used to measure a 1 dimensional quantity
    • −1,0,1,e,π,6.9-1, 0, 1, e, \pi, 6.9
  • rational
    • real numbers that can be expressed as a division of 2 integers
    • have a finite number of non-repeating digits
    • −1,0,12,0.3˙,6.9-1, 0, \frac{1}{2}, 0.\dot{3}, 6.9
  • irrational
    • real numbers that are not rational
    • remain irrational even after being multiplied by an integer
    • infinite number of non-repeating digits
    • −2,e,π-\sqrt{2}, e, \pi
  • integers
    • real numbers without a fractional component
    • discrete which means there are a finite number of them in a bounded interval
    • …−2,−1,0,1,2…\ldots -2, -1, 0, 1, 2 \ldots
  • whole
    • non-negative integers
    • 0,1,2…0, 1, 2 \ldots
  • natural
    • positive integers or whole numbers excluding 00
    • 1,2,3…1, 2, 3 \ldots
  • prime
    • natural numbers that have exactly 2 natural factors
    • excludes 11 because it only has itself as a natural factor
    • 2,3,5,72, 3, 5, 7

Square numbers are integers raised to the power of 22. The integer 11 is a square number because 12=11^2=1. So is 99 because 32=93^2=9. Likewise, cube numbers are integers raised to the power of 33.

Common Factors

Factors that are shared by multiple numbers are called common factors.

  • 4242 and 6969 share 33 as a factor
  • 1818 and 3030 have 2,3,62, 3, 6 as common factors

The best way to find common factors is to use Pihedron's Prime Factor Table. By breaking down a number into a tree, we can not only solve for its prime factors but also multiply different combinations of these prime factors to obtain the full set of factors.

Try changing the number in the textbox!

The right column contains all the prime factors. 6060 has a total of 1212 factors which can be obtained by multiplying every combination of prime factors.

60
sentiment_satisfied
30
2
15
2
5
3
1
5

The highest common factor (HCF) or greatest common denominator (GCD) of multiple numbers can be found by multiplying all their common prime factors together.

36
2, 2, 3, 3
12
2, 2, 3
HCF
60
2, 2, 3, 5

Common Multiples

Natural numbers have an infinite number of multiples. A multiple of NN is a natural number in the form M×NM \times N where MM is another natural number. We often see multiples in the form of times tables.

Most of the time, we are only concerned with the lowest common multiple (LCM) of multiple numbers. THe LCM of:

  • 22 and 33 is 66
  • 66 and 1515 is 3030

Note that the LCM of 2 numbers AA and BB is not always A×BA \times B. This is because the LCM of AA and BB is actually A×B÷CA \times B \div C where CC is the HCF of AA and BB. The LCM can be thought of as the union of the prime factors of AA and BB.

Prime Factors Among Us
A=52×74×11pB=5m×7n−5×11A = 5^2 \times 7^4 \times 11^p \newline B = 5^m \times 7^{n- 5} \times 11

Where mm, nn, and pp are integers such that:

m>2n>10p>1m > 2 \newline n > 10 \newline p > 1

Fortunately, this question has given us the prime factors of both numbers. This means finding the highest common factor is as easy as plugging this question into a formula.

5min⁡(2,m)×7min⁡(4,n−5)×11min⁡(p,1)5^{\min(2, m)} \times 7^{\min(4, n - 5)} \times 11^{\min(p, 1)}

The highest common factor is found by raising each prime to its lowest exponent while the lowest common multiple is found by raising each prime to its highest exponent.

Since we are concerned with the minimum exponent, we want to know the minimum value of these variables to see if they will affect the highest common factor.

mmin=3nmin=11pmin=2m_{min} = 3 \newline n_{min} = 11 \newline p_{min} = 2

When we substitute these lower bounds into the formula, it's obvious that the variables have no effect on the highest common factor.

5min⁡(2,3)×7min⁡(4,6)×11min⁡(2,1)5^{\min(2, 3)} \times 7^{\min(4, 6)} \times 11^{\min(2, 1)}

The final answer is straightforward.

52×74×1115^2 \times 7^4 \times 11^1
4MA1 Jan 2022 1HR
How do we find all the pairs of numbers that have a certain HCF and LCM?

Sometimes it's possible to use Pihedron's Identity to solve problem's involving HCF and LCM. The following example has strong connections with the identity.

The Missing Pair

Two positive integers are each greater than 25.
Their lowest common multiple (LCM) is 216.
Their highest common factor (HCF) is 18.

Find the two integers.


LCM(A,B)=216HCF(A,B)=18\text{LCM}(A, B) = 216 \newline \text{HCF}(A, B) = 18

We can use Pihedron's Theorem to turn this into a counting problem. First, we divide the LCM by the HCF.

21618=12\frac{216}{18} = 12

Next, we count the number of distinct prime factors of 1212.

12=22×31ω(12)=212 = 2^2 \times 3^1 \newline \omega(12) = 2

1212 has 22 distinct prime factors. This means there are only 22−1=22^{2-1}=2 possible pairs to consider. The first pair doesn't work because A,B>25A, B > 25 is not satisfied.

A=18B=18×22×31A = 18 \newline B = 18 \times 2^2 \times 3^1

However, the second pair does.

A=18×22B=18×31A = 18 \times 2^2 \newline B = 18 \times 3^1

Hence, we get 7272 and 5454 as our answers.

4024 Winter 2021 Paper 1 Variant 2

Sets

Set theory has a lot of overlap with probability and boolean logic. You are expected to learn set notation to describe operations on sets.

But what even is a set?

A set is a collection of distinct items of the same type. The distinct trait means that sets do not contain any duplicates.

Before we dive into the fun stuff, it's important to know how we represent different set operations.

  • n(A)\text{n}(A) represents the number of elements in set AA
  • x∈Ax \in A means xx is an element of set AA
  • x∉Ax \notin A means xx is not an element of set AA
  • A′A' is the complement of set AA
  • ∅\varnothing is the empty set
  • E\mathscr{E} is the universal set
  • A⊆BA \subseteq B means AA is a subset of BB
  • A⊈BA \nsubseteq B means AA is not a subset of BB
  • A∪BA \cup B is the union of sets AA and BB
  • A∩BA \cap B is the intersection of sets AA and BB

Set Operations

There are 3 fundamental set operations.

  • A′A' is the set that contains all the elements in E\mathscr{E} except those in set AA
    • acts like its opposite
    • does not share any common elements with the original set
    • A∩A′=∅A \cap A' = \varnothing
  • A∪BA \cup B is the set that includes all the elements present in sets AA and BB
    • same as joining sets together to form a new set
    • always the same size if not bigger than the individual sets
    • n(A∪B)≥n(A)\text{n}(A \cup B) \ge \text{n}(A) and n(A∪B)≥n(B)\text{n}(A \cup B) \ge \text{n}(B)
    • always the same size if not smaller than the sum of the sizes of each set
    • n(A∪B)≤n(A)+n(B)\text{n}(A \cup B) \le \text{n}(A) + \text{n}(B)
  • A∩BA \cap B is the set that only contains the elements present in both sets AA and BB
    • always the same size if not smaller than the individual sets
    • n(A∪B)≤n(A)\text{n}(A \cup B) \le \text{n}(A) and n(A∪B)≤n(B)\text{n}(A \cup B) \le \text{n}(B)

Set Formulas

The sum of the sizes of each set equals the size of their union plus their intersection. This is because when you add the sizes of both sets, you are adding the size of their intersection twice.

n(A)+n(B)=n(A∪B)+n(A∩B)\text{n}(A) + \text{n}(B) = \text{n}(A \cup B) + \text{n}(A \cap B)

The same idea can be applied to HCF and LCM.

A×B=LCM(A,B)×HCF(A,B)A \times B = \text{LCM}(A, B) \times \text{HCF}(A, B)

Venn Diagrams

A Venn diagram is a visual representation of a group of sets. The rectangle represents the universal set while each circle represents a set.

Each enclosed area of a Venn diagram is an intersection of sets or their complements.

A∩B′A \cap B'
A′∩BA' \cap B
A∩BA \cap B
A′∩B′A' \cap B'
(A′∪B′)′(A' \cup B')'
help