|
Bill Allombert on Sat, 27 Jan 2024 13:42:03 +0100
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|
Re: Any chance to compute system of Diophantine exquations in 26 variables in GP?
|
- To: pari-users@pari.math.u-bordeaux.fr
- Subject: Re: Any chance to compute system of Diophantine exquations in 26 variables in GP?
- From: Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>
- Date: Fri, 26 Jan 2024 20:28:48 +0100
- Delivery-date: Sat, 27 Jan 2024 13:42:03 +0100
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=math.u-bordeaux.fr; s=2022; t=1706359319; bh=IXXU+L/ap7z2vorcy2DdcZVRS8Any8ACy4D5+gmGM28=; h=Resent-From:Resent-Date:Resent-To:Date:From:To:Subject:References: In-Reply-To:From; b=iTlc3osarzsLLtbYvWUbd0nV8JBO08RZi3BuCEEPmPw98YFAvGoeLyXtAhLy25KwT GjeRO7tLtFOIeIf2GGnal2RKHhVmGRNlSbzk0CD5Rz5cOp84wAd4o77fxYEhicFN8g U7EtslWdSp022OgD7HmcdSKt6KF4mtACbT/Yo2kqAY+oLKzig5rp69jQTE3z1Cvxv8 dNxXCekjeokUUrKcpCTgbW100+OTwhYT2m1e6p30f0Vp/UBP3grA8X7/01sPjpHX/d 0MDytRoq5ccURg+Szyxm1vdFaISuGkX/LD5dWZ83AoaWd+77fnHy8zVohO1lASsoma oBAeeS8BYGMGyIXg0oTIw45kZCrm4IOEKhk5UCMqV/PKrxPLmHc6PNZ04cuFOg2XZz ZMqaevm9YILZrKC1olzSGAB0c7yKfQZx//AnHuiU9bkwy1TYmeBApA3ad+qLXqOUnF OHBnp689lyUQUcq1oSGGafP+LfoSWLalxZ3yKxYgMo/YDK32jYxXe9nSRXq6rtBdag B/yScm8PF109P/uYFc9L1kn9RFMPKQUlRx4TIEt0RHYGAeFqyf4sTOk15VQK5kgQdG KPAMgtIRKD+gBhkMdXnsiHhhDdIMmmwxl+aXNsfih8JzlYN/hXc3jRAXXu6IGhU9a7 QS6Jmzz2mgssvGZx1S1YWHnU=
- In-reply-to: <ZbOI46rQIx62D8xd@seventeen>
- Mail-followup-to: pari-users@pari.math.u-bordeaux.frl
- References: <9f454ef82d96ebd7401532329ff7bef9@stamm-wilbrandt.de> <ZbOI46rQIx62D8xd@seventeen>
On Fri, Jan 26, 2024 at 11:26:43AM +0100, Bill Allombert wrote:
> On Fri, Jan 26, 2024 at 09:53:47AM +0100, hermann@stamm-wilbrandt.de wrote:
> > I used this system of Diophantine equations:
> > https://en.wikipedia.org/wiki/Formula_for_primes#Formula_based_on_a_system_of_Diophantine_equations
> I assume this is this one:
> <https://maa.org/sites/default/files/pdf/upload_library/22/Ford/JonesSatoWadaWiens.pdf>
>
> If you follow carefully the proof, you should be able to write a program to solve
> it for any small k ! See middle of page 455.
The issue is that the smallest solution is doubly exponential in k^4,
so you will probably not be able to compute it.
(for us k=10)
we solve
(3) (2*k)^3*(2*k+2) * (n+1)^2 + 1 = f^2
? my(Q=quadunit((2*k)^3*(2*k+2)*4)); n=imag(Q)-1; f=real(Q);
? n
%41 = 343772642385433639988435123780
? f
%42 = 144220715637070429940775452568001
(at least!)
but then
p=(n+1)^k
q=(p+1)^n
is going to be too large.
Cheers,
Bill.