![]() |
![]() |
#34 |
May 2011
France
7×23 Posts |
![]()
I don't speak f number with 450 000 bits but one million of digit:
just to store n in digits you need 1Giga But I go to try new method And if I a am speeder or not the earth continue to turn around the sun.. No for matter if XXX is speeder to extract a root: karl Lewis run faster than me, Mark Spits swim faster and I'm still alive John |
![]() |
![]() |
![]() |
#35 | |
May 2011
France
7·23 Posts |
![]() Quote:
http://en.wikipedia.org/wiki/Karatsu...orithm#Example thanks for your answer about complexity Jon |
|
![]() |
![]() |
![]() |
#36 |
(loop (#_fork))
Feb 2006
Cambridge, England
7×911 Posts |
![]()
I am aware that Mr Lewis runs faster than you and Mr Spitz swims faster. JasonP can compute faster than you, also.
But I doubt that you would discuss running with Carl, or swimming with Mark, in the sort of tone in which you are discussing computation with Jason. |
![]() |
![]() |
![]() |
#37 |
Jun 2003
2×32×269 Posts |
![]() |
![]() |
![]() |
![]() |
#38 |
Jan 2008
France
54210 Posts |
![]() |
![]() |
![]() |
![]() |
#39 | |
Mar 2009
2·19 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#40 |
"Lucan"
Dec 2006
England
2×3×13×83 Posts |
![]() |
![]() |
![]() |
![]() |
#41 |
"Lucan"
Dec 2006
England
145128 Posts |
![]()
log^2 N means log(log N) or (log N)^2 ?
c.f. sin2 x = (sin x)2 David Last fiddled with by davieddy on 2011-07-05 at 12:13 |
![]() |
![]() |
![]() |
#42 | ||
May 2011
France
7×23 Posts |
![]()
I do nit now MR Lewis but if you want I can introduce you to M Zimmerman. If he is not teaching 'modular arithmetic' You need too go i n frence his office is the East of the France
You say that Jasonp compute more speeder than me: When II ask to Jasonp he asweer that he not have he times (It' s perfectl his right) but don't say thaht he goes speeder than other I cannot try myselq QSieve because there is no version for my G5 When you want speed you don't use Intel ad Widows. If you want a lage public only. Where have see with what speed I compute? The only time i give is a square root of 1 000000 digits This kind of performance needds work and time Quote:
Sorry EPIC must be famous in your street a little question when Bill Gates present WIN 95 (you was born??) he has game in the hand: you remember? I explain: When X present a new product he also present new software. But X had choice the partner to give his proto You want Apple proto, Bandai,BBox..... Sorry for Dixney I don't, have entrance to Disneyland I give them to my child I give them to @Davieddy Sorry I don't understand Quote:
Last fiddled with by JohnFullspeed on 2011-07-05 at 15:09 |
||
![]() |
![]() |
![]() |
#43 | |
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#44 |
May 2011
France
7·23 Posts |
![]()
Sorry i don't see Kamasutra: I'm to old....
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
new factorization algorithm | jasonp | Math | 2 | 2012-06-17 20:04 |
Sieve algorithm | geoff | Twin Prime Search | 5 | 2010-11-07 17:02 |
Is there an algorithm which solves this? | Unregistered | Homework Help | 0 | 2007-08-09 17:40 |
Maybe new sieving algorithm | nuggetprime | Riesel Prime Search | 5 | 2007-04-20 04:19 |
Prime95's FFT Algorithm | Angular | Math | 6 | 2002-09-26 00:13 |