]> matita.cs.unibo.it Git - helm.git/commit
projects / helm.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: f79c94d) | patch
Testing some performance tricks by caching the list of the first n primes and
authorEnrico Tassi <enrico.tassi@inria.fr>
Thu, 12 Jun 2008 15:52:34 +0000 (15:52 +0000)
committerEnrico Tassi <enrico.tassi@inria.fr>
Thu, 12 Jun 2008 15:52:34 +0000 (15:52 +0000)
commitb55beb8e8b337c9118dacc67f67e7ff1326ad9cb
treeacdb23e851c6b179ef4a4df5306362ab783dfd85tree | snapshot
parentf79c94ded2ae71654374b9b28c1c8b9a63a651accommit | diff
Testing some performance tricks by caching the list of the first n primes and
showing that they are good either with nth_prime (sloooooooooowww) or with
sieve (slooooow and not proved correct yet). With sieve we are currently able
to verify the list of the first 103 primes in a sort of reasonable time.
The 103rd prime is only 593 :-(
helm/software/matita/library/nat/factorization2.ma diff | blob | history
Unnamed repository; edit this file 'description' to name the repository.