Re: Factoring integers on a classical computer
From: Robin Chapman (rjc_at_ivorynospamtower.freeserve.co.uk)
Date: 03/17/05
- Next message: Peter Luschny: "Re: euler(0,1) shows Maple bugs are really ubiquitous"
- Previous message: Darius Blaszijk: "Re: random model"
- In reply to: Craig Feinstein: "Re: Factoring integers on a classical computer"
- Next in thread: *** T. Winter: "Re: Factoring integers on a classical computer"
- Messages sorted by: [ date ] [ thread ]
Date: Thu, 17 Mar 2005 09:05:04 +0000
Craig Feinstein wrote:
> I don't think I was lucky in finding a cycle out of my calculations.
Some of do, or at least think that you created your own luck by
only choosing very small integers.
--
Robin Chapman, www.maths.ex.ac.uk/~rjc/rjc.html
"Elegance is an algorithm"
Iain M. Banks, _The Algebraist_
- Next message: Peter Luschny: "Re: euler(0,1) shows Maple bugs are really ubiquitous"
- Previous message: Darius Blaszijk: "Re: random model"
- In reply to: Craig Feinstein: "Re: Factoring integers on a classical computer"
- Next in thread: *** T. Winter: "Re: Factoring integers on a classical computer"
- Messages sorted by: [ date ] [ thread ]