Thanks for the feedback. I am studying prime factorization of very large numbers. In particular, I am working on tests that work in the inverse of prime factorization. In that, I mean that I am actually testing for composite numbers.
What is quicker; to determine if a number is prime or composite? I need an extreme level of precision because rounding invalidates the protocols within which I can correctly calculate.
I'm using Perl because I can look at a number as a string, parse it at different points and more easily explore a variey of number theories.
Thank you,
...Robert Vaughn, Albuquerque, NM
-------------- Original message --------------
From: David Nicol <[EMAIL PROTECTED]>
> On 1/9/06, [EMAIL PROTECTED] <[EMAIL PROTECTED]>wrote:
>
> > It seems like a simpler question would be; how do I tell Perl to not convert
> > my long numbers to scientific notation?
>
> keep them as strings, as you are doing. Why do you need such accuracy?
> What process is generating real data that you are measuring to nineteen
> digits of accuracy?
>
> Your so-called numbers might be better dealt with as entirely as strings.
_______________________________________________ ActivePerl mailing list [email protected] To unsubscribe: http://listserv.ActiveState.com/mailman/mysubs
