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].(adsbygoogle = window.adsbygoogle || []).push({});

[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.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Prime divisors of 4n^2+4n-1

Loading...

Similar Threads - Prime divisors 4n^2+4n | Date |
---|---|

Consecutive integers such that the prime divisors of each is less or equal to 3 | Oct 6, 2012 |

Find a prime divisor of 1111 (13 1's) | Oct 30, 2011 |

Finding Primes: A Divisor summatory function | Jul 18, 2011 |

Prime Indices & the Divisors of (p'_n - 1): A Lattice-Related Question | Oct 28, 2010 |

Greatest common divisor | Relatively prime | Jan 7, 2010 |

**Physics Forums - The Fusion of Science and Community**