bigNum =: 2 $ 0 _1 + _1 + 2x^7
bigNum
127 126
#bigNum
2
$bigNum
2
So from what I can tell bigNum is a vector with two
elements.
The first element is the prime number 127 and the second
number is 1 less.
This seems to be ok.
Congruent seems to be defective. It worked on my machine at
work (at least I thought
it worked), but when I brought the code home, it is not
working. Hum.........
----- Original Message Follows -----
From: Tracy Harms <[email protected]>
To: Programming forum <[email protected]>
Subject: Re: [Jprogramming] how to speed up 2^N where N >
10,000,000
Date: Fri, 27 Feb 2009 12:20:20 -0800
>A minor note: The shape-two portion next to the copula has
>no effect. Adding 0 _1 to a scalar results in a shape-two
>list. I recognize that this is a minor detail that does not
>contribute toward answering your question.
>
>On Fri, Feb 27, 2009 at 11:10 AM,
>> <[email protected]> wrote: I want to do:
>>
>> bigNum =: 2 $ 0 _1 + _1 + 2x^13466917
>>
>> ...
>-----------------------------------------------------------
>----------- For information about J forums see
>http://www.jsoftware.com/forums.htm
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
