|
Kevin Ryde on Fri, 30 Dec 2022 08:00:49 +0100
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
- To: pari-users@pari.math.u-bordeaux.fr
- Subject: Re: A022921-code
- From: Kevin Ryde <user42_kevin@yahoo.com.au>
- Date: Fri, 30 Dec 2022 17:58:35 +1100
- Delivery-date: Fri, 30 Dec 2022 08:00:49 +0100
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=yahoo.com.au; s=s2048; t=1672383578; bh=0CSfcaP2dcdwYUqXLsAYYK9NwvSqkgAh3WcdexVL9aE=; h=From:To:Subject:References:Date:In-Reply-To:From:Subject:Reply-To; b=Z39OmUxPv5zEqfnCylk8Ot8FY2zpA3GMdJfGgt6Fdy3DzgXhsUh6sUMu0XcZctb+CPs0BBF6FdtMnPq5JVyYWVfIcoeIfVhLMdfpY2ciYf/1PFR5hC/OaELBBdSjG8IuIwKXYxtdt7uBPqUlktykoLCPbnBdV1PNPHTAlWUc43Ur4XzZpntDRBjJGzJ/WEUECiMWAcn2ne3PME+lGjOFs6y+JXjGjvt78yg4WplCBkg6GCI10UL8dZbJa9TRu1P+H1qoBpj4jMUF8W5iKqeuYDifzvfXE9uqnWMPmYKb+yyeYhlweroXGMfiNiDqFQRqEs/f2IIuXvR2V2Vn6esslA==
- In-reply-to: <22f99a3f-71e6-40b4-2fe2-4976ce949665@isolution.nl> (Ruud H. G. van Tol's message of "Wed, 28 Dec 2022 16:28:32 +0100")
- Organization: Bah Humbug
- References: <22f99a3f-71e6-40b4-2fe2-4976ce949665@isolution.nl>
- User-agent: Gnus/5.13 (Gnus v5.13) Emacs/24.5 (gnu/linux)
"Ruud H.G. van Tol" <rvtol@isolution.nl> writes:
>
> [ logint(3^(n+1),2) - logint(3^n,2) |n<-[0..98]]
If n is big, can like to avoid making 3^n only to look at its high bit.
Maybe some dynamically calculated upper and lower bounds on
log(3)/log(2) would be both exact and allow any n.