On Wed, Aug 13, 2014 at 10:18 AM, Chris Angelico wrote:
> On Thu, Aug 14, 2014 at 2:12 AM, Peter Pearson
> wrote:
>> MK Shen used to hang out on the sci.crypt newsgroup, so we're
>> probably talking "cryptographically large" rather than "engineeringly
>> large".
>
> So "fairly large" means somew
Peter Pearson :
> MK Shen used to hang out on the sci.crypt newsgroup, so we're probably
> talking "cryptographically large" rather than "engineeringly large".
I'm thinking we're talking about philosophically large. Those kinds of
numbers are unwieldy from all angles, including cryptography.
Ma
On Thu, Aug 14, 2014 at 2:12 AM, Peter Pearson wrote:
> MK Shen used to hang out on the sci.crypt newsgroup, so we're
> probably talking "cryptographically large" rather than "engineeringly
> large".
So "fairly large" means somewhere between googolplex an Graham's
Number, and after that they'd be
On Wed, 13 Aug 2014 15:58:02 +0200, Peter Otten <__pete...@web.de> wrote:
> Mok-Kong Shen wrote:
>
>> I like to compute log base 2 of a fairly large integer n but
>> with math.log(n,2) I got:
>>
>> OverflowError: long int too large to convert to float.
[snip]
> Or maybe our idea of "fairly large
Steven D'Aprano wrote:
> Mok-Kong Shen wrote:
>
>>
>> I like to compute log base 2 of a fairly large integer n but
>> with math.log(n,2) I got:
>>
>> OverflowError: long int too large to convert to float.
>>
>> Is there any feasible work-around for that?
>
> If you want the integer log2, that
On 13/08/2014 14:46, Mok-Kong Shen wrote:
Am 13.08.2014 15:32, schrieb Steven D'Aprano:
Mok-Kong Shen wrote:
I like to compute log base 2 of a fairly large integer n but
with math.log(n,2) I got:
OverflowError: long int too large to convert to float.
Is there any feasible work-around for th
Mok-Kong Shen wrote:
> I like to compute log base 2 of a fairly large integer n but
> with math.log(n,2) I got:
>
> OverflowError: long int too large to convert to float.
>
> Is there any feasible work-around for that?
What version of Python are you using? Python 2.7 can handle "fairly large"
Am 13.08.2014 15:16, schrieb Skip Montanaro:
http://gnumbers.blogspot.com/2011/10/logarithm-of-large-number-it-is-not.html
Might be worth studying for ideas.
Thanks. I think the idea may help.
M. K. Shen
--
https://mail.python.org/mailman/listinfo/python-list
Am 13.08.2014 15:32, schrieb Steven D'Aprano:
Mok-Kong Shen wrote:
I like to compute log base 2 of a fairly large integer n but
with math.log(n,2) I got:
OverflowError: long int too large to convert to float.
Is there any feasible work-around for that?
If you want the integer log2, that is
Mok-Kong Shen wrote:
>
> I like to compute log base 2 of a fairly large integer n but
> with math.log(n,2) I got:
>
> OverflowError: long int too large to convert to float.
>
> Is there any feasible work-around for that?
If you want the integer log2, that is, the floor of log2, the simplest wa
On Wed, Aug 13, 2014 at 8:05 AM, Mok-Kong Shen
wrote:
> I like to compute log base 2 of a fairly large integer n but
> with math.log(n,2) I got:
>
> OverflowError: long int too large to convert to float.
>
> Is there any feasible work-around for that?
A bit of googling turned up this page:
http:
I like to compute log base 2 of a fairly large integer n but
with math.log(n,2) I got:
OverflowError: long int too large to convert to float.
Is there any feasible work-around for that?
Thanks in advance.
M. K. Shen
--
https://mail.python.org/mailman/listinfo/python-list
12 matches
Mail list logo
