Question

In: Advanced Math

prove that the square of the product of 3 consecutive integers is always divisible by 12

prove that the square of the product of 3 consecutive integers is always divisible by 12

Solutions

Expert Solution

if n(n+1)(n+2) is divisible by 6

than (n(n+1)(n+2))2 = (6l)2 = 36??l2 is divisible by 12

hence   square of the product of 3 consecutive integers is always divisible by 12?


Related Solutions

Use induction to prove that 8^n - 3^n is divisible by 5 for all integers n>=1.
Use induction to prove that 8^n - 3^n is divisible by 5 for all integers n>=1.
a) Prove by induction that if a product of n polynomials is divisible by an irreducible...
a) Prove by induction that if a product of n polynomials is divisible by an irreducible polynomial p(x) then at least one of them is divisible by p(x). You can assume without a proof that this fact is true for two polynomials. b) Give an example of three polynomials a(x), b(x) and c(x), such that c(x) divides a(x) ·b(x), but c(x) does not divide neither a(x) nor b(x).
Prove the following. Let T denote the integers divisible by three. Find a bijection f :...
Prove the following. Let T denote the integers divisible by three. Find a bijection f : Z→T (Z denotes all integers).
Consider all positive integers less than 100. Find the number of integers divisible by 3 or...
Consider all positive integers less than 100. Find the number of integers divisible by 3 or 5? Consider strings formed from the 26 English letters. How many strings are there of length 5? How many ways are there to arrange the letters `a',`b', `c', `d', and `e' such that `a' is not immediately followed by`e' (no repeats since it is an arrangement)?
prove that if you multiply 4 successive integers and take the square root of that +...
prove that if you multiply 4 successive integers and take the square root of that + a number, the only number for which root(product + x) is a perfect square is 1.
Assume that there are a sequence of consecutive integers 1, 2, 3, 4, 5, ... 15....
Assume that there are a sequence of consecutive integers 1, 2, 3, 4, 5, ... 15. Tom and Jim respectively select a number from the sequence randomly (no repetition). Given that Tom’s number is divisible by 5, what’s the probability that Tom’s number is greater than Jim’s number ?
Prove that if the integers 1, 2, 3, . . . , 65 are arranged in...
Prove that if the integers 1, 2, 3, . . . , 65 are arranged in any order, then it is possible to look either left to right or right to left through the list and find nine numbers that are in increasing order
Prove by induction that 14^n + 12^n −5^n is divisible by 7 for all n >0
Prove by induction that 14^n + 12^n −5^n is divisible by 7 for all n >0
1) If x, y, z are consecutive integers in order then 9 | (x+y+z) ⟺ 3...
1) If x, y, z are consecutive integers in order then 9 | (x+y+z) ⟺ 3 | y. (Do proof) 2) Let x, y be consecutive even integers then (x+y) is not divisible by 4. (Show proof and state why it was used)
12 pts) Use Mathematical Induction to prove that an=n3+5n is divisible by 6 when ever n≥0....
12 pts) Use Mathematical Induction to prove that an=n3+5n is divisible by 6 when ever n≥0. You may explicitly use without proof the fact that the product n(n+1) of consecutive integers n and n+1 is always even, that is, you must state where you use this fact in your proof.Write in complete sentences since this is an induction proof and not just a calculation. Hint:Look up Pascal’s triangle. (a) Verify the initial case n= 0. (b) State the induction hypothesis....
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT