Discrete Math Use division into two cases to prove that for every integer n, 2\n(3n +...

Question

Question

Discrete Math

$Use division into two cases to prove that for every integer n, 2\n(3n + 1).$

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

hemce, 2/2K(64+1) Solution : To prove that evey inleger in n(3n+1) as we are asked to division into Now, two cases, Case 1 in Case 2:7 n = odd Inlegen. - 2n-1 (NEN) Now 3M (301 n3n+1] (2n-1) (31 24-1) + 3) = (21-1) (64-3 +1) = (2n-1)(64-2) = QM-1) 213

Add a comment

Answer 2

Similar Homework Help Questions

Discrete Math □ Prove or disprove: If n is any odd integer then (-1)"--1 Problem 6:

Discrete Math □ Prove or disprove: If n is any odd integer then (-1)"--1 Problem 6:
Discrete math show all work please Use mathematical induction to prove that the statements are true...

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 Use mathematical induction to prove that for all positive integers n, 2 + 4...

Discrete Math Use mathematical induction to prove that for all positive integers n, 2 + 4 + ... + (2n) = n(n+1).

Using discrete mathematical proofs: a. Prove that, for an odd integer m and an even integer...

Using discrete mathematical proofs: a. Prove that, for an odd integer m and an even integer n, 2m + 3n is even. b. Give a proof by contradiction that 1 + 3√ 2 is irrational.
Discrete Math: Divisibility (Need Help ASAP, will upvote) 1) Prove that if n is an odd...

Discrete Math: Divisibility (Need Help ASAP, will upvote) 1) Prove that if n is an odd positive integer, then n^2 is congruent to 1 (mod 8)
Exercise 2.4. Prove the two statements below:Use nd ueTion 1. For every integer n 2 3,...

Exercise 2.4. Prove the two statements below:Use nd ueTion 1. For every integer n 2 3, the inequality n2 2n +1 holds. Hint: You can prove this by induction if you wish, but alternatively, you can prove directly, without induction.) 2. For every integer n 2 5, the inequality 2" n holds. (Hint: Use induction and the inequality in the previous part of the exercise.)

n(n+1)(n+2) for every posi- 7. Use mathematical induction to prove that tive integer n.

n(n+1)(n+2) for every posi- 7. Use mathematical induction to prove that tive integer n.
Use mathematical induction to prove that the statement is true for every positive integer n. 5n(n...

Use mathematical induction to prove that the statement is true for every positive integer n. 5n(n + 1) 5 + 10 + 15 +...+5n = 2
Use mathematical induction to prove that the statements are true for every positive integer n. 1...

Use mathematical induction to prove that the statements are true for every positive integer n. 1 + [x. 2 - (x - 1)] + [ x3 - (1 - 1)] + ... + x n - (x - 1)] n[Xn - (x - 2)] 2 where x is any integer 2 1

R->H 7. Prove by induction that the following equation is true for every positive integer n....

R->H 7. Prove by induction that the following equation is true for every positive integer n. (4 Points) 1. 4lk11tl + 2K ²+ 3k 4k+4+H26² +3k {(4+1) = (40k41) 40) j=1 (4i + 1) = 2 n 2 + 3n 2K?+75 +5 21 13 43 041) 262, ultz

Discrete Math Use division into two cases to prove that for every integer n, 2\n(3n +...

Homework Answers

Add Answer to:
Discrete Math Use division into two cases to prove that for every integer n, 2\n(3n +...

Post as a guest

Earn Coins

Discrete Math □ Prove or disprove: If n is any odd integer then (-1)"--1 Problem 6:

Discrete math show all work please Use mathematical induction to prove that the statements are true...

Discrete Math Use mathematical induction to prove that for all positive integers n, 2 + 4...

Using discrete mathematical proofs: a. Prove that, for an odd integer m and an even integer...

Discrete Math: Divisibility (Need Help ASAP, will upvote) 1) Prove that if n is an odd...

Exercise 2.4. Prove the two statements below:Use nd ueTion 1. For every integer n 2 3,...

n(n+1)(n+2) for every posi- 7. Use mathematical induction to prove that tive integer n.

Use mathematical induction to prove that the statement is true for every positive integer n. 5n(n...

Use mathematical induction to prove that the statements are true for every positive integer n. 1...

R->H 7. Prove by induction that the following equation is true for every positive integer n....

Discrete Math Use division into two cases to prove that for every integer n, 2\n(3n +...

Homework Answers

Add Answer to: Discrete Math Use division into two cases to prove that for every integer n, 2\n(3n +...

Post as a guest

Earn Coins

Add Answer to:
Discrete Math Use division into two cases to prove that for every integer n, 2\n(3n +...