math induction
posted by zomg .
prove the product of 4 consecutive integers is always divisible by 24 using the principles of math induction. Could anyone help me on this one? Thanks in advance!
Sure
For induction we want to prove some statement P for all the integers. We need:
P(1) to be true (or some base case)
If P(k) => P(k+1) If the statement's truth for some integer k implies the truth for the next integer, then P is true for all the integers.
Look at the first four integers 1,2,3,4. The product 1*2*3*4 is true for the base case n=1,n+1=2,n+2=3 and n+1=4
Suppose now the statement is true for all integers less than or equal to k, so k*(k+1)(k+2)(k+3) is divisible by 24. We want to show that this implies the statement is true for (k+1)(k+2)(k+3)(k+4)
We should observe that with four consecutive numbers 4 will divide one of them say n, and two will divide n2 or n+2. Three will divide at least one of four consecutive numbers.
You should be able to see that k and k+4 have the same remainder when divided by 4 or 2. This means 8 will divide 4 consecutive numbers. If three does not divide k then it divides one of the next three numbers. If three divides k then it divides k+3. In any case, 8=4*2 and 3 will divide (k+1)(k+2)(k+3)(k+4)
You might be able to simplify my reasoning a little. I didn't proof it closely, so make sure I covered all cases.
thank u very much!
Respond to this Question
Similar Questions

math : induction
The reversal of a string w, denoted w^R, is the string "spelled backwards". For example (reverse)^R = esrever. A careful definition can be given by induction on the length of a string: 1. If w is a string of length 0, then w^R = epsilon … 
Math
Use mathematical induction to prove that 5^(n)  1 is divisible by four for all natural numbers n. Hint: if a number is divisible by 4, then it has a factor of 4. also, 1 = 5 +4 This is a take home test so I don't want the answer … 
Math  Mathematical Induction
3. Prove by induction that∑_(r=1)^n▒〖r(r+4)=1/6 n(n+1)(2n+13)〗. 5. It is given that u_1=1 and u_(n+1)=3u_n+2n2 where n is a positive integer. Prove, by induction, that u_n=3^n/2n+1/2. 14. The rth term of … 
AP Calc
Use mathematical induction to prove that the statement holds for all positive integers. Also, can you label the basis, hypothesis, and induction step in each problem. Thanks 1. 2+4+6+...+2n=n^2+n 2. 8+10+12+...+(2n+6)=n^2+7n 
Calculus
Use mathematical induction to prove that the statement holds for all positive integers. Also, label the basis, hypothesis, and induction step. 1 + 5 + 9 + … + (4n 3)= n(2n1) 
Math
Prove by induction that 9^(n+2) 4n is divisible by 5 for n greater than or equal to 1. Thanks. 
Math
Use mathematical induction to prove that 2^(3n)  3^n is divisible by 5 for all positive integers. ThankS! 
Computer proof
Prove by induction on all positive integer k that if m is any ordinary nfa with k states, and m has fewer than k  1 transitions, then there exists a state of m that is not reachable. Let N be the λNFA: "L" for "λ" b >(1) … 
Mathematical induction. I'm stuck. So far I have..
For all integers n ≥ 1, prove the following statement using mathematical induction. 1+2^1 +2^2 +...+2^n = 2^(n+1) −1 Here's what I have so far 1. Prove the base step let n=1 2^1=2^(1+1)1 False. Someone else suggested that … 
Math, Induction
prove by induction that 3.7^(2n)+1 is divisible by 4