DISCRETE MATHEMATIC
For question 1, Use mathematical induction to prove the statements are correct for n ∈ Z+(set of positive integers).
1. Prove that for n ≥ 1
1 + 8 + 15 + ... + (7n - 6) = [n(7n - 5)]/2
For question 2, Use a direct proof, proof by contraposition or proof by contradiction.
2. Let m, n ≥ 0 be integers. Prove that
if m + n ≥ 59 then (m ≥ 30 or n ≥ 30).
1) n>=1, 1 + 8 + 15 + ... + (7n - 6) = [n(7n - 5)]/2
Base case: n = 1, [n(7n - 5)]/2 = 1*2/2=1. The statement 1=1 is true.
Assume for n the statement is true, so 1 + 8 + 15 + ... + (7n - 6) = [n(7n - 5)]/2
For n+1 the series will 1 + 8 + 15 + ... + (7n - 6) + (7*(n+1)-6) => [n(7n - 5)]/2 + 7n+1 => (7n^2 - 5*n + 14*n + 2)/2 = (7*n^2+9*n+2)/2
[(n+1)(7*(n+1) - 5)]/2 => (7*(n+1)^2 - 5*n -5)/2 => (7(n^2+2*n+1)-5*n-5)/2 => (7(n^2)+14*n-5*n+7-5)/2 => (7*n^2+9*n+2)/2
We can see that 1 + 8 + 15 + ... + (7n - 6) + (7*(n+1)-6) =>[(n+1)(7*(n+1) - 5)]/2
Hence proved
2) m+n>=59 => m >= 59 - n and n >= 59 - m
lets assume m<=29 => -m >= -29 => 59 - m >= 30
Combining n >= 59 - m and 59 - m >= 30 we get n>=30
Lets assume n <=29 => -n >= -29 => 59 - n >= 30
Combining m >= 59 - n and 59 - n >= 30 we get m >= 30
Hence proved that m>=30 or n>=30.
DISCRETE MATHEMATIC For question 1, Use mathematical induction to prove the statements are correct for n...
Discrete Math Use mathematical induction to prove that for all positive integers n, 2 + 4 + ... + (2n) = n(n+1).
Discrete Math Question. (8 pts) Use mathematical induction to prove 13 + 33 +53 + ... + (2n + 1)3 = (n + 1)?(2n+ 4n +1) for all positive integers n.
Discrete math show all work please Use mathematical induction to prove that the statements are true for every positive integer n. n[xn - (x - 2)] 1 + [x2 - (x - 1)] + [x:3 - (x - 1)] + ... + x n - (x - 1)] = 2 where x is any integer = 1
Discrete Math 11. (8 pts) Use mathematical induction to prove that Fan+1 = F. + F for all integers n 20, where Fn is the Fibonacci sequence defined recursively by Fo = 1, F = 1, and F F 1+F2 for n 22. Write in complete sentences since this is a proof exercise.
11: I can identify the predicate being used in a proof by mathematical induction and use it to set up a framework of assumptions and conclusions for an induction proof. Below are three statements that can be proven by induction. You do not need to prove these statements! For each one clearly state the predicate involved; state what you would need to prove in the base case; clearly state the induction hypothesis in terms of the language of the proposition...
1. Prove the following statement by mathematical induction. For all positive integers n. 2++ n+1) = 2. Prove the following statement by mathematical induction. For all nonnegative integers n, 3 divides 22n-1. 3. Prove the following statement by mathematical induction. For all integers n 27,3" <n!
Use the Principle of mathematical induction to prove 2. Use the Principle of Mathematical Induction to prove: Lemma. Let n E N with n > 2, and let al, aa-.., an E Z all be nonzero. If gcd(ai ,aj) = 1 for all i fj, then gcd(aia2an-1,an)1. 1, a2,, an
Question 3 You should be able to answer this question after studying Unit 9. (a) Use mathematical induction to prove that the following statement is 10 marks true: [9 n - n is a multiple of 3 for all n 2 1. (b) Show that the following statement is false: n-n is a multiple of 4 for all n 2 1. Question 4-10 ma You should be able to answer this question after studying Unit 9. (a) Use proof by...
1. Use mathematical induction to prove ZM-1), in Ik + 6 for integers n and k where 1 <k<n - 1. = 2. Show that I" - P(m + k,m) = P(m+n,m+1) (m + 1) F. (You may use any of the formulas (1) through (14”).)
7n Use Mathematical Induction to prove that Σ 2-2n+1-2, for all n e N