Conjecture: If P is odd, then there is one and only one number n in the set {1,2,3,...(P-1)} which satisfies the equation (32*n^2 + 3n) = 0 mod P an this number. Can anyone help me with a proof of this? If by chance this is a trival matter. I have gone further and determined 4 equations for n based upon the value of P mod 8, but I will leave that for later. I would like to know if the conjecture is trival first.(adsbygoogle = window.adsbygoogle || []).push({});

**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!

# Conjecture re 32n^2 + 3n

Loading...

Similar Threads - Conjecture 32n^2 | Date |
---|---|

Our Old Friend, the Twin Primes Conjecture | Oct 23, 2014 |

Beal Conjecture - Demonstration | Dec 11, 2013 |

Proof of the twin primes conjecture | Jun 29, 2013 |

Some ideas concerning the Goldbach conjecture | Dec 25, 2012 |

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