use math induction for proof

Related BrainMass Solutions

• Discrete Math: Mathematical Induction

  Without using Theorem 4.2.2, use mathematical induction to prove that P(n): 1 + 5 + 9 + ... + (4n - 3) = n(2n - 1) for all integers n >= 1 Proof: n=1, P(1)=1=n(2n-1), so the statement is true for n=1.

• Summation and series

  By induction, for , we have . Thus is true. We are done. 10. Proof. is true since . Suppose is true, then we have . By induction, for , we have . Thus is true. We are done. 11. Proof. is true since .

• Discrete Math: Proof using Mathematical Induction

  7101 Discrete Math: Proof using Mathematical Induction 1.Use mathematical induction to prove that 2-2*7+2*7^2-.....+2(-7)^n=(1-(-7)^n+1)/4 whenever n is a nonnegative integer. 2.Show that 1^3+2^2+....n^3=[n(n+1)/2]^2 whenever n is a positive integer

• Induction and real numbers

  Proof: a. When , is true. Suppose the equation is true, then for , we have Thus the equation also holds for . Therefore, the equation holds for any positive integer . b. Let and , then . But we have Thus . c.

• Steps on solving 4 discrete math questions

  Solve for B: B= Please check attachment The solution gives detailed step on solving 4 discrete math questions on the topic of mathematical induction, Gaussian elimation and matrix operation. All formula and calculations are shown and explained.

• Mathematical induction proof

  396659 Mathematical Induction Proof See Attachment. Use mathematical induction to prove that LOG(base2) n < n. (n > 0, n E N) Why is the basis step (step 1) in mathematical induction necessary?

• Proof : Equivalence Relations

  We prove this statement using the principle of Mathematical Induction. For n=1, which is divisible by 8. So, for n=1, the statement is true. Let the statement is true for n=k. Hence we let is divisible by 8.

• Mathematical Induction

  147413 Proof by Mathematical Induction Use mathematical induction to prove that the given statement is true for all positive integers n. n! <= n^n Proof: If n=1, n!=1!=1 and 1^1=1. So n!<=n^n holds for n=1. Suppose n!

• Discrete math proofs

  We are done. 6) By induction show that 1*2*3 + 2*3*4 +...n(n+1)(n+2) = n(n+1)(n+2)(n+3)/4 Proof. Base step: check for n=1, LHS=1*2*3=6 RHS=1*(1+1)*(1+2)*(1+3)/4=6 So, it is true for n=1.