If n is an integer, show that one of the integers n, n+2, or n+4 is divisible by 3.
solution:
If n is a multiple of 3, then there is nothing more to prove.
Suppose n is not a multiple of 3, then n must be of the form
n =3k+1 or n = 3k+2, for some integer k
if n=3k+1,
then n+2 = (3k+1)+2 = 3k+3 = 3(k+1) = multiple of 3
if n = 3k+2,
then n+4 = 3k+6 = 3(k+2) =multiple of 3
hence the result
some other math problems
disclaimer:
There is no guarantee about the data/information on this site. You use the data/information at your own risk.You use the advertisements displayed on this page at your own risk.
st
Subscribe to:
Post Comments (Atom)
SAT Word Problems Made Easy: The Tricks for Speed, Work, Age & Profit
SAT Word Problems Distance, Speed, Work, Age, Mixtures & Profit — A Smarter Way to Decode the Question 🎯 Why SAT Word Problems Feel H...
-
reduction formula for (sinx)^m (cosx)^n with limits 0 to pi/2 in the numerator start off with (m-1) , (n-1) subtract 2 successively till 2 o...
-
cos[(3pi/4)+x] - cos[(3pi/4)-x] = (-sqrt(2))sinx ncert 11th trigonometry, exercise 3.3 11. prove that cos[(3pi/4)+x] - cos[(3pi/4)-x]...
-
Before taking the driving test you have to get a learner's license.For that you had to to take an objective test on the computer in the ...
No comments:
Post a Comment
please leave your comments