Reviewer in Mathematics in the Modern World for Quiz

Chapter 1: Nature of Mathematics

Mathematics is a/an…
1)Study of patterns
2)Language
3)Process of thinking
4)Art of problem-solving tools
5)Art

Patterns
are regular, repeated, or recurring forms or designs.
It can be studied to help students identify relationships and find logical connections to form
generalizations and make predictions.

KINDS OF PATTERNS

Patterns of Visuals- Visual Patterns are often unpredictable, never quite repeatable, and often contain
fractals.

Patterns of Flow- Patterns of Flow are usually found in the water, stone, and even in the growth of trees.

Patterns of Movement- The prevalence pattern of locomotion includes human or horse walking, flights
of birds, and wave-like movements of fish, worms, and snakes.

Patterns of Visuals- Visual Patterns are often unpredictable, never quite repeatable, and often contain
fractals.

Patterns of Flow- Patterns of Flow are usually found in the water, stone, and even in the growth of trees.

Patterns of Movement- The prevalence pattern of locomotion includes human or horse walking, flights
of birds, and wave-like movements of fish, worms, and snakes.\

Patterns of Rhythm- Rhythm is conceivably the most basic pattern in nature.

Patterns of Texture- A texture is a quality of certain object that we sense through touch.

Geometric Patterns- A Geometric pattern is a kind of pattern which consists of a series of shapes that
are typically repeated.

PATTERNS

Example:

What number comes next in 1, 4, 9, 16, 25,

Answer: 36
Explanation: Notice that the given numbers are the squares of natural numbers 1, 2, 3, 4, and 5. Hence,
the square of 6 (which is 36) is the next number in the pattern.
SEQUENCE
is a function whose domain is the set of natural numbers or a subset of the natural numbers.
The elements in the range of the sequence are called terms of the sequence.
To distinguish a sequence from an ordinary function, we shall denote the independent variable as n (not
x).

NOTATIONS IN A SEQUENCE
Sequence
Notation:
𝑓1=𝑎1,
𝑓2=𝑎2,
𝑓3=𝑎3, …
𝑓𝑛=𝑎𝑛

KEY CONCEPTS IN A SEQUENCE

•Recall: A function is a special type of relation where no two ordered pairs have the same first
coordinates.
•Recall: The domain of a function is the set of permissible values of the independent variable/s.
•Recall: A subset is a set taken from the given set.

SEQUENCE
Example:
The first three terms of the sequence 𝑎𝑛=n+2 are 𝑎1=1+2=3, 𝑎2=2+2=4, and 𝑎3=3+2=5.

TYPES OF SEQUENCE
•Finite Sequence- a sequence whose domain is a finite subset of natural numbers.
•Infinite Sequence- a sequence whose domain is the set of natural numbers or an infinite subset of natural
numbers.
•Remark: The type of sequence depends on its domain.
•Remark: An ellipsis does not guarantee an infinite sequence.
•Example: 1,3,5,…,27,29

WAYS TO DESCRIBE A SEQUENCE

•1. Using an 𝑛𝑡ℎ−term formula
•Example: 𝑎𝑛=3n−5
•2. Using a recurrence relation
•Example: 𝑎𝑛=𝑎𝑛;1+𝑎𝑛;2
Exercise: Find the first five terms of the following:
1)𝑎𝑛=3n−5
2)𝑎𝑛=𝑎𝑛;1+𝑎𝑛;2,𝑎1=1,𝑎2=1

Exercise:
Find the 𝑛𝑡ℎ term formula of the following:
1.)1, 6, 13, 22, 33, …
n 1 2 3 4 5
an 1 6 13 22 33
6−1=513−6=7,22−13=9,33−22=11
7−5=2,9−7=2,11−9=2
We achieved the common difference at the second level.

Thus, the general form of the equation will become 𝑎𝑛=𝐴𝑛2+𝐵𝑛+𝐶 (eq. I)
Hence, we need three equations to determine the values of A, B, and C.
If 𝑎1=1, then by substituting to eq. I, we have
1=𝐴(1)2+𝐵1+𝐶
1=𝐴+𝐵+𝐶 eq. 1
If 𝑎2=6, then by substituting to eq. I, we have
6=𝐴(2)2+𝐵2+𝐶
6=4𝐴+2𝐵+𝐶 eq. 2
If 𝑎3=13, then by substituting to eq. I, we have
13=𝐴(3)2+𝐵3+𝐶
13=9𝐴+3𝐵+𝐶 eq. 3

1=𝐴+𝐵+𝐶 eq. 1
6=4𝐴+2𝐵+𝐶 eq. 2
13=9𝐴+3𝐵+𝐶 eq. 3

Use Elimination method.

Notice that it is easier to eliminate the variable C since we can subtract two equations.
𝑒𝑞.2 −𝑒𝑞.1
3𝐴+𝐵=5 𝑒𝑞.4
𝑒𝑞.3 −𝑒𝑞.2
5𝐴+𝐵=7 𝑒𝑞.5

3𝐴+𝐵=5 𝑒𝑞.4
5𝐴+𝐵=7 𝑒𝑞.5

Now, eliminate the variable B.

𝑒𝑞.5 −𝑒𝑞.4
2𝐴=2→𝐴=1
If 𝐴=1, by substituting to eq. 4, we have
31+𝐵=5
3+𝐵=5
𝐵=2
If 𝐴=1 𝑎𝑛𝑑 𝐵=2, by substituting to eq. 1, we have
1+2+𝐶=1
3+𝐶=1
𝐶=−2
Since 𝐴=1, 𝐵=2 𝑎𝑛𝑑 𝐶=−2, by substituting to 𝑒𝑞.I, it follows that 𝑎𝑛=𝑛2+2𝑛−2
Check your answer by substituting 𝑛=1 until 𝑛=5

2. )3, 7, 13, 22, 35, …

n 1 2 3 4 5
an 3 7 13 22 35
7−3=4,13−7=6,22−13=9,35−22=13
6−4=2,9−6=3,13−9=4
3−2=1,4−3=1
We achieved the common difference at the third level.
Thus, the general form of the equation will become 𝑎𝑛=𝐴𝑛3+𝐵𝑛2+𝐶𝑛+𝐷 𝑒𝑞.𝐼𝐼
Hence, we need four equations to determine the values of A, B, C, and D.
If 𝑎1=3, then by substituting to eq. II, we have
3=𝐴(1)3+𝐵(1)2+𝐶(1)+𝐷
3=𝐴+𝐵+𝐶+𝐷 eq. 1
If 𝑎2=7, then by substituting to eq. II, we have
7=𝐴(2)3+B(2)2+𝐶2+𝐷
7=8𝐴+4𝐵+2𝐶+𝐷 eq. 2
If 𝑎3=13, then by substituting to eq. II, we have
13=𝐴(3)3+𝐵(3)2+𝐶3+𝐷
13=27𝐴+9𝐵+3𝐶+𝐷 eq. 3
If 𝑎4=22, then by substituting to eq. II, we have
22=𝐴(4)3+𝐵(4)2+𝐶4+𝐷
22=64𝐴+16𝐵+4𝐶+𝐷 𝑒𝑞.4

3=𝐴+𝐵+𝐶+𝐷 eq. 1
7=8𝐴+4𝐵+2𝐶+𝐷 eq. 2
13=27𝐴+9𝐵+3𝐶+𝐷 eq. 3
22=64𝐴+16𝐵+4𝐶+𝐷 𝑒𝑞.4

Again, use Elimination method.

Notice that it is easier to eliminate the variable D since we can subtract two equations.
𝑒𝑞.2 −𝑒𝑞.1
7𝐴+3𝐵+𝐶=4 𝑒𝑞.5
𝑒𝑞.3 −𝑒𝑞.2
19𝐴+5𝐵+𝐶=6 𝑒𝑞.6
𝑒𝑞.4 −𝑒𝑞.
37𝐴+7𝐵+𝐶=9 𝑒𝑞.7

7𝐴+3𝐵+𝐶=4 𝑒𝑞.5
19𝐴+5𝐵+𝐶=6 𝑒𝑞.6
37𝐴+7𝐵+𝐶=9 𝑒𝑞.7

Now, eliminate the variable C.

𝑒𝑞.6 −𝑒𝑞.5
12𝐴+2𝐵=2 𝑒𝑞.8
𝑒𝑞.7 −𝑒𝑞.6
18𝐴+2𝐵=3 𝑒𝑞.9

12𝐴+2𝐵=2 𝑒𝑞.8
18𝐴+2𝐵=3 𝑒𝑞.9

Now, eliminate the variable B.

𝑒𝑞.9 −𝑒𝑞.8
6𝐴=1 →𝐴=16
If 𝐴=16, by substituting to eq.8, we have
1
12 +2𝐵=2
6
2+2𝐵=2
2𝐵=0
𝐵=0
If 𝐴=1/6 𝑎𝑛𝑑 𝐵=0, by substituting to eq.5, we have
7(1/6)+30+𝐶=4

7/6+𝐶=4
𝐶=17/6
If 𝐴=1/6,𝐵=0,𝑎𝑛𝑑 𝐶=17/6), by substituting to eq.1, we have 16+0+176+𝐷=3→3+𝐷=3→𝐷=0
Since 𝐴=1/6, 𝐵=0,𝐶=17/6,and D=0,
by substituting to eq. II, we have 𝑎𝑛=1/6𝑛3+17/6𝑛
Check your answer by substituting 𝑛=1 until 𝑛=5.

ARITHMETIC SEQUENCE
Arithmetic Sequence- is a special type of sequence where the next terms are obtained by adding the so-
called common difference.
To determine if a sequence is Arithmetic, check the differences between consecutive terms and it
should be equal.
Ex: 1, 3, 5, 7,…
3−1=𝟐,5−3=𝟐,7−5=𝟐,𝑑=2

𝑛𝑡ℎ term formula 𝑎𝑛=𝑎1+𝑛−1𝑑

Derivation: 𝑎2=𝑎1+𝑑 𝑎3=𝑎2+𝑑=𝑎1+𝑑+d=𝑎1+2𝑑 𝑎4=𝑎3+𝑑=𝑎1+2𝑑+d=𝑎1+3𝑑
… 𝑎𝑛=𝑎1+(𝑛−1)𝑑

Arithmetic Series- sum of n terms of an arithmetic sequence.

Trivia: Carl Friedrich Gauss, regarded as one of the greatest mathematicians of all time, was once a grade
school student when he answered the sum of 1 to 100 in a matter of seconds.
He argued that 1+100=101,2+99=101,… and there are 50 pairs of it. So, 𝑆100=10150=5050.
It was that argument where the formula for the sum of n terms was discovered.
𝑆𝑛=𝑛(𝑎1+𝑎𝑛)/2
The above formula simply states that the sum of n terms can be computed as the product of the number
of terms and the average of the first and last terms.
However, not all arithmetic sequences have explicit last terms.
So, there is a need to find an alternative formula where the last term is not required.
𝑆𝑛=𝑛/2[2𝑎1+(𝑛−1)𝑑]
Notice that there is no last term in the formula above.
Example:
Find the 18th term of the sequence 1, 3, 5, 7,…
Solution: 𝑎1=1, 𝑑=2, 𝑛=18
By substitution,
𝑎18=𝑎1+(18−1)𝑑
𝑎18=1+(17)2
𝑎18=1+34
𝑎18=35
GEOMETRIC SEQUENCE
Geometric Sequence- is a special type of sequence where the next terms are obtained by multiplying the
so-called common ratio.
To determine if a sequence is Geometric, check the ratios between consecutive terms and it should be
equal.
Ex: 2, 4, 8, 16,…
4/2 =2,8/4 =2,16/8 =2, 𝑟=2
HARMONIC SEQUENCE AND HARMONIC MEAN
Harmonic Sequence- is a special type of sequence where the terms are the reciprocal of the terms in an
arithmetic sequence.
Example: 1,1/2,1/3,1/4,1/5,…
Harmonic Mean- is obtained by getting the ratio of the number of observations by the reciprocal of each
number in the series:
Example: Find the harmonic mean of 3 𝑎𝑛𝑑 5.

FIBONACCI SEQUENCE
Fibonacci Sequence- is a special type of sequence where the next term is obtained by adding the
previous two terms.
1, 1, 2, 3, 5, 8, 13, 21, … 𝐹𝑛=𝐹𝑛;1+𝐹𝑛;2
The ratios of two successive Fibonacci numbers approach the number Φ≈1.618, which is the Golden
Ratio.
The seeds on a sunflower possess these Fibonacci numbers.
Formula for computing for the nth term in the Fibonacci Sequence

MATHEMATICS
Chapter 2: Mathematics as a language
Unlike the language of ordinary speech, mathematical language is
 Precise (able to make very fine distinctions)
 Concise (able to say things briefly)
 Powerful (able to express complex thoughts with relative ease)

Example: The word “anyone” in ordinary speech is ambiguous.

 Can “anyone” work on this problem? (Existential Quantifier)
 “Anyone” can do it! (Universal Quantifier)

 Definition- is a concise statement of the basic properties of an object or concept which

unambiguously identify that object or concept.
 Every concept is defined as a subclass of a more general concept, called the genus.
 Each special subclass of the genus is characterized by special features called species.

• Good Definition
 A rectangle is a quadrilateral all four of whose angles are right angles.
• Poor Definition (not concise)
 A rectangle is a parallelogram in which the diagonals have the same length and all the angles are
right angles. It can be inscribed in a circle and its area is given by the product of two adjacent
sides.

• Poor definition (not basic)

 A rectangle is a parallelogram whose diagonals have equal lengths.
• Bad definition (ambiguous)
 A rectangle is a quadrilateral with right angles.
• Unacceptable definition (no genus)
 rectangle: has right angles
 Guidelines for Definitions in Good Form
 A definition MUST be written as a complete, grammatically correct English sentence.
 A definition MUST be an if and only if statement.
 A definition MUST have a clearly stated genus and a clearly-stated species.
 The quantifiers in a good definition MUST be explicitly and clearly stated.
 The term being defined MUST be underlined.

Expressions vs. Sentences

 An expression is the mathematical analogue of an English noun; it is a correct arrangement of
mathematical symbols used to represent a mathematical object of interest.
 An expression does not state a complete thought; it does not make sense to ask if an expression is
true or false.
 The most common expression types are numbers, sets, and functions.
 A mathematical sentence is the analogue of an English sentence; it is a correct arrangement of
mathematical symbols that states a complete thought.
 Sentences have verbs.
 In the mathematical sentence ‘3+ 4=7’, the verb is ‘=’.

A sentence can be (always) true, (always) false, or sometimes true/sometimes false.

 For example, the sentence ‘1+2=¿ 3’ is true.
 The sentence ‘1+2=4 ’ is false.
 The sentence ‘x=2’ is sometimes true/sometimes false: it is true when x is 2, and false
otherwise.
 The sentence ‘x + 3 = 3 + x’ is (always) true, no matter what number is chosen for x.

 A Set is a well-defined collection of distinct objects.

Examples
 The set of counting numbers from 1 to 10
 The set of even numbers
 The set of odd numbers
 The set of integers
 The set of real numbers

 Each member of a set is called an element of that set and is represented by the Greek letter
epsilon ϵ .
 Elements in a set are separated by commas.
 If an object is not an element of a set, then it is represented by ∉.
Terminologies in Set
1) A unit set is a set containing only one element.
2) 2) An empty set (null set) is a set which has no element. It is represented by ∅ .
3) 3) A finite set is a set which has countable elements.
4) 4) An infinite set is a set which has uncountable elements.
5) 5) The cardinality (cardinal number) is a number used to describe the quantity of elements in a
set.
6) 6) Two sets are said to be equal if and only if they have equal cardinalities and exactly the same
elements.
 7) 7) Two sets are said to be equivalent if and only if they have equal cardinalities only.
8) 8) A Universal set is a set under the given conditions.
9) 9) Two sets are said to be joint if and only if they share common element/s.
10) 10) Two sets are said to be disjoint if and only if they do not share common element/s.

Ways of describing a Set

1) Listing Method (Roster Method)- it is done by listing all the elements under the given
condition/s.
2) Rule Method (Set-Builder Notation)- it is done by stating or describing the common
characteristics of the elements of a set.

Illustration:
A={ 1, 2 , 3 , 4 , 5 }- Listing Method or Roster Method
A={x │ x is a natural number ¿1 ¿ 5 }- Rule Method or Set-Builder Notation
B={a , b , c , … , z }- Listing Method or Roster Method
B={ x │ x is an English alphabet }- Rule Method or Set-Builder Notation

 A set A is a subset of a set B, written as A ⊆ B , if for every element of A, it is also an element of

B.
 The formula in getting the number of subsets in a given set A is given by n( ρ ( A ))=2n( A) , where
n( ρ ( A )) is the number of subsets and n(A) is the number of elements in A.
 Apply the Pascal’s Triangle to determine the subsets of any given set.

1
1 1
1 2 1
1 3 1 3
⋮
1………………………………1
Pascal’s Triangle

Example: How many subsets are there in

A={a , b , c , d } ?
Solution: By applying the Pascal’s Triangle, we have 1 empty set, 4 unit sets, 6 2-element sets, 4 3-
element sets, and the set itself.
Hence, ρ ( A )={ϕ , { a } , { b } , { c } , { d } , { a ,b } , { a , c } ,
{a , d } , {b , c }, {b , d } , {c , d } , {a , b , c }, {a , b , d } ,
{ a , c , d } , {b , c , d } , {a , b , c , d } }

The power set of a set A, written as ρ(𝐴), is the set containing all the subsets of A.
n(ρ(𝐴))=2^𝑛

Operations on Sets
 The union of two sets A and B, denoted by 𝐴∪𝐵, is the set defined as𝐴∪𝐵={𝑥│𝑥∈𝐴 𝑜𝑟 𝑥∈𝐵}
 The intersection of two sets A and B, denoted by A ∩ B, is the set defined by
A ∩ B={ x │ x ∈ A∧x ∈ B }.
  The absolute complement of a set A, denoted by A' , is the set defined by
'
A ={ x │ x ∈U but x ∉ A }.
 The relative complement (or set difference) of two sets A and B, denoted by A−B , is the set
defined by A−B={x │ x ∈ A but x ∉ B }.
 The Cartesian Product of two sets A and B, denoted by AxB, is the set defined by
AxB= {( a ,b )|a ∈ A∧b ∈ B }

Given A={ 1, 2 , 3 } , B={2 , 4 , 6 }, and

C={ 1,2,3,4,5,6 } , find the following:
1. A ∪B 2. A ∩ B 3. A' 4. A−B 5. AxB

Relations and Functions

 Let A and B be sets. A relation R from A to B is a subset of the cross product AxB.
 If (a , b) ∈ AxB , then aRb if and only if (a , b) ∈ R .
 The set A is called the domain of R while the set B is called the co-domain.

Let A={ 1, 2 , 3 } and B={2 , 4 , 6 }. Let R be the

¿ relation. Determine if the following is true or false.
1. 1 R 2
2. 2 R 2
3. 3 R 4
4. 3 R 2
5. 1 R 6

Properties of a Relation
1. R is reflexive if and only if (a , a) ∈ R .
2. R is symmetric if given ( a , b ) ∈ R then (b , a) ∈ R
3. R is transitive if given ( a , b ) ,(b , c)∈ Rthen ( a , c ) ∈ R .
An equivalence relation is a relation that is reflexive, symmetric, and transitive.

 A function f from A to B is a relation that satisfies the following properties:

1) dom ( f ) =A
2) If ( x , y ) ,( x , z )∈ f , then y=z .
Determine if the following is a function or not.
1. x 2+ y 2=1 not 2. y=3 x−5 yes

Operations on Functions
 ( f ± g ) ( x ) =f ( x ) ± g(x )
 ( fg ) ( x )=f ( x) ⋅ g( x)

 ( fg ) ( x )= gf (x)
(x)
, g( x )≠ 0
 ( f ∘ g )( x )=f (g ( x ))

 Let G be a non-empty set. An operation ¿ on G is said to be a binary operation on G if for every

a , b ∈G , a∗b ∈G .
  A set C is closed (under the binary operation ¿) if ¿ assigns to every ordered pair of elements
from the set an element of the set.
 Let ¿ be a binary operation on a set S.
 ¿ is associative if for all a , b , c ∈ S,
a∗( b∗c )=(a∗b)∗c
 ¿ is commutative if for all a , b ∈ S ,
a∗b=b∗a
 An element e of S is an identity element if for all a ∈ S , e∗a=a∗e=a.
 Let e be the identity element of S and a ∈ S . Then b ∈ S is an inverse element if a∗b=b∗a=e .

Determine if the following is a binary relation or not.

1. G=Z , ¿ is the usual division
2. G=N , ¿ is the usual subtraction
3. G=R +¿,¿ ¿ is defined by a∗b=√ a−b
4. G=Z +¿, ¿ ¿ is defined by a∗b=a−b
5. G=R , ¿ is defined by a∗b=2 a+3 b

Chapter 3: Problem solving and reasoning

Inductive Reasoning- is the process of reaching a conclusion by examining specific examples.

Conjecture- is the conclusion formed by using inductive reasoning.

A statement is a true statement provided that it is true in all cases.

If you can find one case for which a statement is not true, called a counterexample, then the statement is a
false statement.
Find a counterexample for the following:
1) |x|>0
2) x 2> x
3) √ x 2=x
x
4) =1
x
x+3
5) = x+1
3

Consider the following procedure: Pick a number. Multiply it by 8, add 6 to the product, divide the sum
by 2, and subtract 3.

First step: Let n be the chosen number.

Second step: 8 n
Third step: 8 n+6
8 n+6
Fourth step: =4 n+3
2
Fifth step: ( 4 n+3 ) −3=4 n

Inductive vs. Deductive Reasoning

Inductive- specific to general
Deductive- general to specific
Example: Determine whether each of the following arguments is an example of inductive reasoning or
deductive reasoning.

1) During the past 10 years, a tree has produced plums every other year. Last year, the tree did not
produce plums. Thus, this year, the tree will produce plums.
2) All Gillian Flynn novels are worth reading. The novel Gone Girl is a Gillian Flynn novel. Thus,
Gone Girl is worth reading.

Principle of Mathematical Induction

1) Form your set S and let S ⊆ N .
2) Show that 1 ∈ S.
3) Assume n ∈ S (Hypothesis of Induction) and show that ( n+1 ) ∈ S .
4) Conclude that S=N .

n(n+ 1)
Using PMI, show that 1+2+…+ n= , for all natural numbers.
2
Proof:
n ( n+1 )
1) Let S={n ∈ N ∨1+ 2+ …+n= }.
2
Let S ⊆ N .
1(1+1) 2
2) 1= = =1. Thus, 1 ∈ S.
2 2
3) Assume n ∈ S . So,
n(n+1)
1+2+…+ n+ ( n+1 )= +( n+1) , by HOI
2
n
¿ ( n+1 ) [ +1]
2
n+2
¿ ( n+1 ) [ ]
2
( n+1 ) +1
¿ ( n+1 ) [ ]
2
Hence, ( n+1 ) ∈ S .
n(n+ 1)
4) Therefore, S=N , that is, 1+2+…+ n= , for all natural numbers. ∎
2
Using PMI, show that 1+3+…+ ( 2n−1 )=n 2, for all natural numbers.
Proof:
1) Let S= {n ∈ N|1+3+ …+ ( 2 n−1 )=n2 } .
Let S ⊆ N .
2) 1=12 =1. Thus, 1 ∈ S.
3) Assume n ∈ S . So,
1+3+…+ ( 2n−1 ) + [ 2 ( n+1 )−1 ]
 2
¿ n +[2 ( n+1 ) −1], by HOI
2
¿ n +[2 n+2−1]
¿ n2 +2 n+1=(n+1)2
Hence, ( n+1 ) ∈ S .
4) Therefore, S=N , that is,
1+3+…+ ( 2n−1 )=n 2
for all natural numbers. ∎
Class Activity (30 minutes)
Using PMI, show that the following statements hold for all natural numbers:

n(n+1)(2 n+1)
2
1) 1+4 +…+ n =
6
2 2
n ( n+ 1)
2) 1+8+ …+n3=
4
Using PMI, show that n < 4n , for all natural numbers
2

Proof:
1) Let S={n ∈ N ∨n2 <4 n }. Let S ⊆ N .
2) 12=1< 41=4 . Thus, 1 ∈ S.

3) Assume n ∈ S . So, (n+1)2=n 2+2 n+1 .

Since n2 < 4n by HOI, it follows that
n2 +2 n+1< 4n +2 n+1
Since 2 n+1<4 n +4 n +4 n, it follows that
n n n n n n+1
4 +2 n+1<4 +4 + 4 + 4 =4
2 n
Since n +2 n+1< 4 +2 n+1 and
n n+ 1
4 +2 n+1<4 , it follows that
2 n +1
n +2 n+1< 4
Hence, ( n+1 ) ∈ S .
4) Therefore, S=N , that is, n2 < 4n , for all natural numbers.
Using PMI, show that n3 +2 n is divisible by 3 for all natural numbers.
Proof:
1) Let S={n ∈ N ∨n3 +2 n=3 q , q ∈ Z }. Let S ⊆ N .
2) 13 +2 (1 )=1+2=3=3(1).
Thus, 1 ∈ S since q=1 ∈ Z .
3) Assume n ∈ S . So,
(n+1)3 +2 ( n+1 )=n 3+3 n 2+3 n+ 1+ 2n+ 2
¿ ( n3 +2 n ) +(3 n2 +3 n+3)
2
¿ 3 q+3 (n +n+1), by HOI
¿ 3 ( q+ n +n+1 )
2

2
¿ 3 j , q+n + n+1= j∈ Z
Hence, ( n+1 ) ∈ S .
4) Therefore, S=N , that is, n3 +2 n is divisible by 3 for all natural numbers.
Reading Assignment No. 3
In our module, kindly read and reflect on the differences between Intuition, Proof and Certainty.
Polya’s Four Steps in Problem Solving
1) Understand the Problem.
2) Devise a plan.
3) Carry out the plan.
4) Review the solution.

Example: A baseball team won two out of their last four games. In how many different orders could they
have two wins and two losses in four games?
Solution:
Understand the Problem. There are many different orders. The team may have won two straight games
and lost the last two (WWLL). Or maybe they lost the first two games and win the last two (LLWW). Of
course there are other possibilities, such as WLWL.
Devise a plan. We will make an organized list of all the possible orders. An organized list is a list that is
produced using a system that ensures that each of the different orders will be listed once and only once.
Carry out the plan. Each entry in our list must contain two Ws and two Ls . We will use a strategy that
makes sure each order is considered, with no duplications.
One such strategy is to always write a W unless doing so will produce too many Ws or a duplicate of one
of the previous orders. If it is not possible to write a W, then and only then do we write an L. This
strategy produces six different orders shown below.
1) WWLL (start with two wins)
2) WLWL (Start with one win)
3) WLLW
4) LWWL (Start with one loss)
5) LWLW
6) LLWW (Start with two losses)
Review the solution. We have made an organized list. The list has no duplicates and the list considers all
possibilities, so we are confident that there are six different orders in which a baseball team can win
exactly two out of four games

Page 19-28 in Module

Patterns in Nature
Waves and Dunes
Spots and Stripes
Spirals
Symmetries
Reflection symmetry – line symmetry/mirror symmetry
Rotations
Translations

Symmetries in Nature
Human Body
Animal Movement
Sunflower
Snowflakes
Honeycombs/Beehive
Starfish
Fibonacci in Nature