Answer:3,500
Step-by-step explanation:
Answer:
i think C is the answer.
Step-by-step explanation:
Answer:
option 1 both statements are true
Step-by-step explanation:
Prove by PMI -- Principle of Mathematical Induction
1) n³ + 2n
n= 1 , 1³ +2*1 = 1+2 = 3 = 3*1 ---->divisible by 3
n = 2 ; 2³ + 2*2 = 8+4 = 12 = 3*4 ----> is divisible by 3
Assume that It is valid for n = k ;
= 3*m -----(I) , for all m ∈ N
We have to prove for n =k +1 , the statement is true.
n = k+1,
= k³ + 3k² + 3k + 3 + 2k
= k³ + 2k + 3k² + 3k + 3
= 3m + 3 (k² + k + 1)
= 3(3 + [k² + k + 1] ) is divisible by 3
Therefore, this statement is true
2)
This statement is also true
Answer:
2^26
Step-by-step explanation:
For a true - false examination ; number of options or possible outcomes = 2
Number of questions = 26
Using the counting principle ; the number of elements in the sample space ;
(2 * 2 * 2 *... * 2) for the entire 26 questions
This is equivalent to : 2^26
2^26 = 67108864
La primera es 264.6
La segunda es 125
Si no me equivocó