Which Prime Divisors of 4n^2+4n-1 Are Congruent Modulo 8 to \pm 1?

  • Context: Graduate 
  • Thread starter Thread starter TTob
  • Start date Start date
  • Tags Tags
    Prime
Click For Summary

Discussion Overview

The discussion revolves around the properties of prime divisors of the expression 4n^2 + 4n - 1, specifically focusing on their congruence modulo 8. Participants are exploring the conditions under which these prime divisors are congruent to ±1 modulo 8, with references to quadratic residues and number theory concepts.

Discussion Character

  • Exploratory
  • Mathematical reasoning

Main Points Raised

  • One participant states the need to prove that every prime divisor p of 4n^2 + 4n - 1 is congruent modulo 8 to ±1, noting that the expression is odd and thus p must be congruent to ±1, 3, or 5 modulo 8.
  • Another participant questions the congruence modulo 7, providing a specific example with n=5, suggesting that the answer may not be straightforward.
  • A participant reiterates the need to prove that p is congruent to ±1 modulo 8.
  • One participant presents a mathematical argument that 4n^2 + 4n - 1 can be expressed as (2n+1)^2 - 2, indicating that p divides this expression only if 2 is a quadratic residue modulo p, which is true only if p is congruent to ±1 modulo 8.
  • A similar point is made again regarding the quadratic residue condition and its implications for p.
  • Another participant expresses confusion about the discussion, suggesting that the problem may not have been clearly organized, but acknowledges that one participant has correctly understood the situation.

Areas of Agreement / Disagreement

There is no clear consensus among participants. While some agree on the need to establish the congruence of p modulo 8, others raise questions and present differing viewpoints regarding specific cases and interpretations.

Contextual Notes

Participants reference quadratic reciprocity and the properties of quadratic residues, but there are unresolved assumptions regarding the implications of these concepts for the prime divisors in question.

TTob
Messages
21
Reaction score
0
I need to prove that p congruent modulo 8 to [tex]\pm 1[/tex] for every prime divisor p of [tex]4n^2+4n-1[/tex].
[tex]4n^2+4n-1[/tex] is odd so we have
[tex]p \equiv \pm 1,3,5 \pmod{8}[/tex]

I don't know how to continue from here... I need some hint.

Thanks.
 
Last edited:
Physics news on Phys.org
TTob said:
I need to prove that p congruent to [tex]\pm 1[/tex] for every prime divisor p of [tex]4n^2+4n-1[/tex].

Congruent modulo what? [itex]7|(4.5^2+4.5-1)[/itex], but [itex]7\neq\pm 1(5)[/itex], so presumably the answer is not [itex]n[/itex].
 
I need to prove that p congruent modulo 8 to [tex]\pm 1[/tex].
 
[itex]4n^2+4n-1=(2n+1)^2-2=0(p)[/itex] only if [itex]2[/itex] is a quadratic residue mod [itex]p[/itex] which is true only if [itex]p=\pm 1(8)[/itex]. (This is proved in any number theory text in the section on quadratic reciprocity.)
 
Martin Rattigan said:
[itex]4n^2+4n-1=(2n+1)^2-2=0(p)[/itex] only if [itex]2[/itex] is a quadratic residue mod [itex]p[/itex] which is true only if [itex]p=\pm 1(8)[/itex]. (This is proved in any number theory text in the section on quadratic reciprocity.)

Thank you !
 
[tex]p \equiv \pm 1,3,5 \pmod{8}[/tex]

Boy! that was a confusing bunch of stuff. Lot of times, the trouble with a problem is the writer did not correctly organize what he wants to solve. But I see, TTob got it all correct!
 

Similar threads

Replies
48
Views
6K
Replies
4
Views
3K
Replies
9
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
12
Views
4K
Replies
16
Views
3K
  • · Replies 2 ·
Replies
2
Views
6K
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
13K