- Puzzle: Prove (but not experimentally) that there is a value of t for which
is a prime number.
Proving by classical means that for this value of t , this prime number is unique is certainly much more difficult.
- --- 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.