Does `qfbsolve(,3)` misses solutions in p=5;so=qfbsolve(Qfb(p,p,p),3*p,3

Georgi Guninski on Wed, 10 Jul 2024 11:21:43 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Does `qfbsolve(,3)` misses solutions in p=5;so=qfbsolve(Qfb(p,p,p),3*p,3)?

To: pari-dev@pari.math.u-bordeaux.fr
Subject: Does `qfbsolve(,3)` misses solutions in p=5;so=qfbsolve(Qfb(p,p,p),3*p,3)?
From: Georgi Guninski <gguninski@gmail.com>
Date: Wed, 10 Jul 2024 12:21:17 +0300
Delivery-date: Wed, 10 Jul 2024 11:21:43 +0200
Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20230601; t=1720603300; x=1721208100; darn=pari.math.u-bordeaux.fr; h=to:subject:message-id:date:from:mime-version:from:to:cc:subject :date:message-id:reply-to; bh=xj9XWNt424oWZUSumb3uIcjNWOKQTmjSrPVQ8wzxwKo=; b=EXlO5KpH8axUkHnrMQoi2eqbiubmrC/nOdpDuIUtCRiIBjzXiHYSy64QfX2x9dGuEu hdz3qn2XgJK5L9byBvFYj50ryf5T3UdcL800yrvgWRcxn8yl/6DDfjAyV/c5oW3zQaT5 KUg5a5B/HDfeqUP6L2CE3O+S/Hogdf6d+PEoFNPLoNt6O98noa5ngJUCUPLfdXrI/3e0 y9wUtkbQFbQ9n+kmiUkpsSlc/nV00JJHWm0d/T5kEVEfZSlR4kJ6A67qihAtlwCeTVmi umRRG37n8Dyts7d0WAZKRuY8J5ZC/9pjWZ0QCq50zxwqjTDmwj3Oofno6MAi2OL+o7Lc gHtw==

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?

Follow-Ups:
- Re: Does `qfbsolve(,3)` misses solutions in p=5;so=qfbsolve(Qfb(p,p,p),3*p,3)?
  - From: Aurel Page <aurel.page@normalesup.org>

Prev by Date: Feature-deliberations: coverage
Next by Date: Re: Does `qfbsolve(,3)` misses solutions in p=5;so=qfbsolve(Qfb(p,p,p),3*p,3)?
Previous by thread: Feature-deliberations: coverage
Next by thread: Re: Does `qfbsolve(,3)` misses solutions in p=5;so=qfbsolve(Qfb(p,p,p),3*p,3)?
Index(es):
- Date
- Thread