- ... Factorization would be quicker if you would use msieve. Incidentally, angle trisection was considered inMessage 1 of 33 , Nov 1, 2011View Source--- In email@example.com,
"mikeoakes2" <mikeoakes2@...> wrote:
> N is divisible by every prime p = 1 (mod 4) and p<=137.Factorization would be quicker if you would use msieve.
> The quotient is composite, but too hard for pari-GP to
> factorise (as yet).
Incidentally, angle trisection was considered in
> We propose the field of "geometric cryptography," where messagesDavid
> and ciphertexts may be represented by geometric quantities such
> as angles or intervals, and where computation is performed by ruler
> and compass constructions.
- ... I saw that, thanks David! Since this is a list dedicated to primes, I ll also just mention briefly that yafu has one of the fastest sieve of EratosthenesMessage 33 of 33 , Nov 8, 2011View Source--- In firstname.lastname@example.org, David Cleaver <wraithx@...> wrote:
>I saw that, thanks David!
> Ben, I've been trying to tell them how awesome Yafu is! You can see my message
> If anyone needs any factoring utilities, yafu should be first on the list. Then
> some combination of yafu/msieve/ggnfs to factor larger numbers. I tried to
> spell it all out in the above post. Hopefully I didn't misrepresent any info
> about yafu. Please correct me if I was wrong. If anyone has any questions,
> feel free to ask on this list.
> -David C.
> P.S. For full disclosure, I helped contribute a small amount of code to yafu. :)
Since this is a list dedicated to primes, I'll also just mention briefly that yafu has one of the fastest sieve of Eratosthenes implementations I'm aware of, for generating lists of primes in arbitrary ranges up to 10^19. Maybe that is useful to folks here too.