Proving 3 Divides at Least One Integer

  • Thread starter Thread starter dgentile
  • Start date Start date
  • Tags Tags
    Integer
AI Thread Summary
To prove that 3 divides one of the integers n, n + 2, or n + 4 for any integer n, consider the possible remainders when n is divided by 3, which are 0, 1, or 2. If n has a remainder of 0, then n is divisible by 3. If n has a remainder of 1, then n + 2 will be divisible by 3. If n has a remainder of 2, then n + 4 will be divisible by 3. The proof relies on examining each case of the remainder, confirming that at least one of the three integers is divisible by 3. This demonstrates the validity of the statement for any integer n.
dgentile
Messages
3
Reaction score
0

Homework Statement



Prove that 3 divides one of the integers n, n + 2, or n + 4, for any integer n.


Homework Equations





The Attempt at a Solution


 
Physics news on Phys.org
Try, ok? Any integer n has a remainder of either 0, 1 or 2 when divided by 3. Come on.
 
Okay...so what's the formula for proving that true is my question?

Thanks
 
Read the forum rules. You are supposed to put something in the "attempt at a solution section". I just gave you a hint. There really is no 'formula'.
 
Let n be any such integer. THen by the division algorithm there exist integers q and r such that

n=3q+r,

n+2=3q_1+r

n+4=3q_2+r 0\leq r<3

i.e r=0, 1 or 2

Now, say if r=0, what happens? if r=1, what happens? if r=2 what happens?

P.S. This is what Dick said, i just wanted to make a little bit easier on you.
YOu MUST show your work next time.
 

Thread 'Finding the number of ways to arrange identical balls in a circle (3 different colors)'

I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
View full post »

Thread 'Greatest possible value of a constant in polynomial'

Since ##px^9+q## is the factor, then ##x^9=\frac{-q}{p}## will be one of the roots. Let ##f(x)=27x^{18}+bx^9+70##, then: $$27\left(\frac{-q}{p}\right)^2+b\left(\frac{-q}{p}\right)+70=0$$ $$b=27 \frac{q}{p}+70 \frac{p}{q}$$ $$b=\frac{27q^2+70p^2}{pq}$$ From this expression, it looks like there is no greatest value of ##b## because increasing the value of ##p## and ##q## will also increase the value of ##b##. How to find the greatest value of ##b##? Thanks
View full post »

Similar threads

Proof That 6 Divides Any Integer N
Replies
3
Views
2K
Find integer points on this equation
Replies
8
Views
1K
For n>3, show that the integers n, n+2, n+4 cannot all be prime
Replies
27
Views
3K
Find the highest power of ## 3 ## dividing ## 823 ##
Replies
9
Views
2K
Prove that the Goldbach conjecture that every even integer....
Replies
6
Views
2K
Prove: If the integer ## a ## is not divisible by ## 2 ## or ## 3 ##....
Replies
9
Views
2K
Prove that ## 7, 11 ##, and ## 13 ## all divide ## N ##
Replies
6
Views
2K
Show that ## 2^{n} ## divides an integer ## N ##.
Replies
6
Views
2K
Proof That an Integer is Divisible by 2
Replies
3
Views
2K
Show that 13 is the largest prime that can divide....
Replies
7
Views
2K

Hot Threads

Recent Insights

Back
Top