|
Bill Allombert on Thu, 07 Nov 2024 16:32:41 +0100
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|
Re: Game: find the integers
|
- To: pari-users@pari.math.u-bordeaux.fr
- Subject: Re: Game: find the integers
- From: Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>
- Date: Thu, 7 Nov 2024 16:32:37 +0100
- Delivery-date: Thu, 07 Nov 2024 16:32:41 +0100
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/simple; d=math.u-bordeaux.fr; s=2022; t=1730993559; bh=eKY9dCd1jXPMPkHA0jdIonVvd2eMBdp3tflMRsmUJDo=; h=Date:From:To:References:In-Reply-To:From; b=VjTLiIijOTMCpzSi1quOAftcWoVi6plX+G5hPH27mQINczmTvW7ADiT4CGd2H5o3R +vfqEXXrxImMx5kpj9OlWqIjYlaSZV0a3qV3yFIB+iqjnOGIrKQT83W3JF1LirpShf /F3RZbM0gMTamC0y512WKw4uStWJVgkJtndkP/JONCcmgqaMtPKf1uUaeWgefhBr75 P2UtyrmVYDkv02Lj88twp2SjmhV9AA33ttsn6dgyllmy45c6+BYn7Ko7ZNwixiyeuV NGSkkR7pev4Z/bWGSh+HMNoQI8jInExYzhKQoKNTQe44jVc3DaZerfuJ5XR7zIas75 tjEwQKuzaZ3VmEn0G9vmHJtc6I9jitN7gtTnRfH998sM2D0rvYUnppsjjqiN6gKWxA ci4bsQiCHxgMTfjc0zRCR5jjHTIvSICypaVZ9XsLtlWC4NigYLfwEWsag8w6FpFIGl KgMyy0CbRxME0rYgfmS7Yjs8v+LP5t6fLPGc/+y/FJRcokjNRWaOa5zMqojjI42rsg ZdNRCTMNCRklsPAFtUmSEyjbEWXqZssyEOQO6jJTC0u7ZANwa1O6A2HhcwrSWomIfK Ynvw6Um7+hf4JEItgCqT6R5SXa2cwvjBixn3/sOe+i1ocyh0t0jO2PxwPX+pR42AEv 8nqDhbMpgNLf7nXb8rnd4PTc=
- In-reply-to: <5d702a2a-c079-4f55-bee3-160d2f6af00d@gmail.com>
- Mail-followup-to: pari-users@pari.math.u-bordeaux.fr
- References: <ZyvCEEqkVg_6bvmb@seventeen> <9b8be9b8-dcf0-48f5-92e8-e238d77cbafb@gmail.com> <d3a107169f3a08d9f75384fba6c398e9@stamm-wilbrandt.de> <A7t19WY66lEVGCUs3GGWslPB6uI2NWyrMSg9SOESpTzSWC15Ix3JxVNEreRLx7PdyS2K9MY1p1UOiMGVrQRtFa3rTHY9pJqmpOgj38eHeyg=@protonmail.ch> <5d702a2a-c079-4f55-bee3-160d2f6af00d@gmail.com>
On Wed, Nov 06, 2024 at 02:41:42PM -0800, American Citizen wrote:
> This strongly suggests running the following GP-Pari script
>
> for(i=0,100,for(j=1,10000000,n=j*(2^(2*i))-1;k=2*eulerphi(n)-n-1;if(k==0,print(2*i,",",j,",",n))))
>
> but I am not sure of how much time this is going to take.
At least it finds the first non trivial solution (83623935) quickly:
? for(i=0,100,for(j=1,10000000,n=j*(2^(2*i))-1;k=2*eulerphi(n)-n-1;if(k==0,print(2*i,",",j,",",n))))
0,2,1
0,4,3
0,16,15
0,256,255
0,65536,65535
2,1,3
2,4,15
2,64,255
2,16384,65535
4,1,15
4,16,255
4,4096,65535
4,5226496,83623935
>From that it is easy to get the missing ones, so good answer!
Cheers,
Bill