Prove that 3n^2 - 1 can't be a square of a integer n

  • Thread starter Thread starter walker242
  • Start date Start date
  • Tags Tags
    Integer Square
walker242
Messages
12
Reaction score
0
Well, the problem statement is in the title:
Given that n is an integer, show that 3n2 - 1 can't be the square of an integer.

Currently, I don't have any idea at all where to start. Method is probably to assume opposite and show that this leads to a contradiction.

Any hint as to where to start would be very appreciated!
 
Physics news on Phys.org
Look at remainders mod 4. What are the possible values for n^2 mod 4?
 
Thanks for the reply!

While that probably is one way of looking at the problem, we haven't yet reached modulus in our studies.
 
You don't really need to study modulus to think about remainders after division by 4. Nothing else comes to mind as an approach.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top