Timeline for Diophantine equation that has an infinite number of positive integers solutions
Current License: CC BY-SA 4.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 16, 2020 at 6:48 | comment | added | Safwane | Sorry,The true equation is: $$16(n+1)^2q^8+16(n+1)^2q^6+1=m^2$$ | |
Jun 15, 2020 at 17:06 | history | edited | castor | CC BY-SA 4.0 |
added 6 characters in body
|
Jun 15, 2020 at 17:05 | comment | added | Steven Stadnicki | @Safwane Can you provide a quartic Diophantine equation for which every prime is a solution? :P The point here is that any integer solution to your equation would ALSO provide be a solution to the equation that castor treats here and shows to have only a finite number of solutions. | |
Jun 15, 2020 at 16:58 | history | edited | castor | CC BY-SA 4.0 |
added 8 characters in body
|
Jun 15, 2020 at 16:52 | comment | added | castor | Your polynomial is $q^8+q^6-2$ and it can be written as $X^4+X^3-2$ with $X=q^2.$ | |
Jun 15, 2020 at 16:47 | history | edited | castor | CC BY-SA 4.0 |
added 922 characters in body
|
Jun 15, 2020 at 16:25 | history | answered | castor | CC BY-SA 4.0 |