Aurel Page on Wed, 10 Jul 2024 11:38:05 +0200 |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
Re: Does `qfbsolve(,3)` misses solutions in p=5;so=qfbsolve(Qfb(p,p,p),3*p,3)? |
Dear Georgi,Even with flag=1, qfbsolve returns solutions up to the action of the orthogonal group. In your case, [2,-1] and [1,1] are in the same orbit.
Best, Aurel On 10/07/2024 11:21, Georgi Guninski wrote:
I am experimenting with integer factorization described in [1] Does qfbsolve(,3) misses the solution [1,1] in: ? p=5;so=qfbsolve(Qfb(p,p,p),3*p,3) %5 = [[2, -1]] [1]: https://mathoverflow.net/questions/474328/could-efficient-solutions-of-x2n-y2-a-be-related-to-integer-factorization Could efficient solutions of x^2+n y^2=A be related to integer factorization?