How Does Modular Arithmetic Relate to Odd Prime Numbers?

Daveyboy
Messages
57
Reaction score
0
b>1, p an odd prime

b2 = -1 mod p

if p|b2 + 1
show p = 1 mod 4

I know that the order of b is 4 (mod p)
 
Last edited:
Physics news on Phys.org
That's a strange approach to use...
I would do it this way: Since p is odd, and p|a^2 + 1, a must be an even number. a^2 thus = 0 (mod 4), and consequently a^2 + 1, and p are both congruent to 1 (mod 4)
 
haha, oh man it's so obvious, I can't believe I missed it.
 
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