Will Edgington <[EMAIL PROTECTED]> writes:
> Foghorn Leghorn writes:
> >Could you factor a Mersenne number without storing it in memory?
> >(Answer: I don't *think* so) Ptoo bad. If we could factor
> >Mersenne numbers on an unmodified TI-92+, then there'd be a lot of
> >people
Foghorn Leghorn writes:
>Could you factor a Mersenne number without storing it in memory?
>(Answer: I don't *think* so) Ptoo bad. If we could factor
>Mersenne numbers on an unmodified TI-92+, then there'd be a lot of
>people who'd run that program.
Uh, that's exactly what Pri
lrwiman writes:
However, I cannot think of any way to do an LL test without storing
the number in memory. Is there way?
Yes. All of the GIMPS programs do the LL test without the Mersenne
number itself.
The LL test programs do, however, need to store numbers as large as
the Mersenne num
>You could build yourself one of those memory expanders that have been designed
>for the TI-92+, and BOOM, instant LL tester. Or even factoring machine. Could
>you factor a Mersenne number without storing it in memory? (Answer: I don't
>*think* so) Ptoo bad.
Yes, actually you can. By using a
At 08:46 PM 6/17/99 -0400, [EMAIL PROTECTED] wrote:
>The "majority view" is the way it is because a number of Darn Good (TM)
>heuristic arguments have been made that the number of Mersenne Primes is
>infinite,
Furthermore, I haven't seen any (good) argument at all as to why they should be
onl
Could you
>factor a Mersenne number without storing it in memory? (Answer: I don't
>*think* so) Ptoo bad. If we could factor Mersenne numbers on an
>unmodified TI-92+, then there'd be a lot of people who'd run that program.
Uh, that's exactly what Prime95 does. To test whether a potential fac
<>
The "majority view" is the way it is because a number of Darn Good (TM)
heuristic arguments have been made that the number of Mersenne Primes is
infinite, just like Darn Good (TM) heuristic arguments exist that the number
of Fermat primes is finite (and probably =4).
TI-81s run on 2MHz Z80s
