Professional Documents
Culture Documents
1
5. What is the Addition Axiom of Additive Inverses?
a. If A & B are real numbers, then A+B=B+A
b. If A & B are real numbers, then A+B is a unique real number.
c. There is a unique real number, symbolized “0”, such that for any other real number,
“A”.
d. For every real number “A” there is a unique real number, symbolized “-A” such that
A+(-A)=0 & (-A)+A=0
State that because of the contradiction, it can't be the case that the statement is false,
so it must be true.
3. What is the contrapositive of the statement “The sum of a rational number and irrational
number is irrational”?
Answer: The sum of a rational number and irrational number is rational.
2
5. Prove by contradiction: √ 2+ √ 6< √ 15.
Then, √ 2+ √ 6> √ 15
Thus, √ 2+ √ 6< √ 15
2. 1+3+5+7+… +(2n-1) = n2 On the basis assumption, [The statement is true for n=k:
1+3+5+7+… +(2k-1) = k 2 ] What must we show?
a. The statement is true for n=k+1: 1+3+5+7+… +(2k-1) (2k+1) = (k +1 ¿ ¿2
b. The statement is true for n=k 1+3+5+7+… +(2k-1) = k 2
c. The statement is true for n=1: 2x1 – 1= 12
.
3
3. The second part (If the statement is true for n=k, then it will be true for its sucessor, k+1)
contains the induction hypothesis. What is it?
a. If the statement is true for n=k, then it will be true for its successor, k+1.
b. The statement is true for n=k.
c. The statement is true for n=k+1.
4
k 2 +k 2 k+ 2 ( k +1 ) [ ( k + 1 )+1 ]
+ =
2 2 2
k +k +2 k + 2 ( k +1 ) [ ( k +1 ) +1 ]
2
=
2 2
k 2 +3 k +2 ( k +1 ) [ ( k +1 ) +1 ]
=
2 2
(k + 1)(k +2) ( k +1 ) [ ( k +1 ) +1 ]
=
2 2
( k +1 ) [ ( k +1 ) +1 ] ( k +1 ) [ ( k + 1 )+ 1 ]
=
2 2
Therefore n=k is true ---- n= k+1 is also true. By mathematical induction the statement
n(n+1)
1+2+3+…+n = is true for n ∈ N
2
(2)3 = 2 (2)2
8=8
5
2(k + 1)2(k + 2)2 = 2(k + 1)2(k + 2)2
∴ the statement 23 + 43 + 63 + . . . + (2n)3 = 2n2(n+1)2 is true for all natural numbers n
Therefore n=k is true ---- n= k+1 is also true. By mathematical induction the statement
3 3 3 3 2 2
2 +4 +6 +…+(2n ¿ ¿ = 2n (n+1)
9! 6! 10 !
= 3! ( 6 ) ! = 4 ! ( 2) ! = 7 ! ( 3) !
9 x8 x7 x 6! 6 x5 x 4 x3 x2! 10 x 9 x 8 x 7 !
= 3 x 2 x 1 (6 )! = 4 x 3 x 2 x 1 (2)! = 7 !3 x2 x1
6
B. Write the binomial expansion of the expression
4. (x2 + 5)8
Answer:
(x2 + 5)8 = 8C0( x 2 ¿ ¿ 8 50 + 8C1( x 2 ¿ ¿7 51 + 8C2( x 2 ¿ ¿6 52+ 8C3( x 2 ¿ ¿5 53 + 8C4( x 2 ¿ ¿ 4 54 + 8C5(
2 3 5
x ¿¿ 5 +
Direction: Given the recursive formula for the Fibonacci Sequence F n= F n−1+ F n−2, find the
following:
a. F 3
F n= F n−1+ F n−2
F 3= F 3−1 + F 3−2
F 3= F 2+ F 1
F 3= 1 + 1
F 3= 2
b. F 4
F n= F n−1+ F n−2
F 4= F 4−1+ F 4−2
F 4= F 3+ F 2
F 4= 2 + 1
F 4= 3
7
c. F 5
F n= F n−1+ F n−2
F 5= F 5−1 + F 5−2
F 5= F 4+ F 3
F 5= 3 + 2
F 5= 5
d. F 6
F n= F n−1+ F n−2
F 6= F 6−1+ F 6−2
F 6= F 5+ F 4
F 6= 5 + 3
F 6= 8
e. F 7
F n= F n−1+ F n−2
F 7= F 7−1+ F 7−2
F 7= F 6+ F 5
F 7= 8+ 5
F 7= 13
8
400=50x8
Problem 2:
Divide 1675 by 13, list out dividend, divisor, quotient, remainder and write division
algorithm.
Answer: Dividend= 1675 divisor=13 quotient=128 remainder=11
Division Algorithm:
1675 = 128x13+11
Problem 3:
What is dividend, when divisor is 17, the quotient is 9 and the remainder is 5?
Answer: Dividend= 158 divisor=17 quotient=9 remainder=5
b = qa + r
= (17)(9) + 5
= 158
Problem 4:
When the integer n is divided by 8, the remainder is 3. What is the remainder if 6n is
divided by 8?
Answer: 2
Problem 5:
On dividing 12401 by a certain number, we get 76 as quotient and 13 as remainder. What
is the divisor?
Answer: Divisor= 163
b = aq + r
12401 = a(76) + 13
12401 – 13 = 76a
12388 = 76a
163 = a
9
Activity no. 8 (Radix Representation as a Number)
Name: FARAH MAE A. MOSQUITE Course: MAEd-MATHEMATICS Score:____________
478 =3910
2. Binary
Answer: (48) = ¿
(78) = ¿
478 = (100111)2
3. Hexadecimal
Answer: 478 = (27)16
10
11