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
Showing posts with label number theory. Show all posts
Showing posts with label number theory. Show all posts
Subscribe to:
Posts (Atom)
SAT Math Probability: Conditional Probability, Two-Way Tables, Formulas and Practice
SAT Math Probability: Formulas, Conditional Probability, Two-Way Tables and Practice Probability on the SAT Math section is often less abo...
-
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...
-
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 ...
-
derive the mean and variance of the binomial distribution now to find the variance, we rewrite x^2 as x(x-1) +x before we start out for expl...