Mohsen Afshin

 Wolfram Mathematica

Welcome! This is the main Mathematica chat room for mathematic...
Dec 20, 2013 16:50
Does any body know how to implement k-ary Left to right version of PowerMod in MMA?
 
Dec 20, 2013 11:19
@tchronis, I forgot to say that I didn't get any drop link from you. Where did you send it?
Dec 19, 2013 20:00
And left with 1312 numbers to be PRPed. I just started two instance of OpenPFGW after performing thousands of randomization over the final list ... Hope to catch one ...
Dec 19, 2013 19:59
I sieved up to 225,000,000
Dec 19, 2013 09:17
Bye
Dec 19, 2013 09:17
You too
Dec 19, 2013 09:17
Thanks for your time
Dec 19, 2013 09:14
supercomputers using Raspery PI
Dec 19, 2013 09:14
I saw some other news about
Dec 19, 2013 09:14
It's a hardware
Dec 19, 2013 09:14
At first, I though it's a service
Dec 19, 2013 09:13
Free?
Dec 19, 2013 09:11
Wow, removing 5 composite in 20 minutes
Dec 19, 2013 09:10
thanks
Dec 19, 2013 09:09
My supercomputer has two nodes and 4 threads :-)
Dec 19, 2013 09:09
And those top class ones have some baby supercomputers with 1000 to 2000 nodes, I just heard the news ...
Dec 19, 2013 09:08
No, most of universities in Iran except some 5 top class ones in our capital, don't have and even "don't know" supercomputers or Grid ...
Dec 19, 2013 09:07
And If I was nothing would change since "I" was going to create a small supercomputer for our university using PS3 in 2007, but ........
Dec 19, 2013 09:06
no
Dec 19, 2013 09:06
I'm grad
Dec 19, 2013 09:06
I think we (our codes, MMA, other apps ...) are some how slower than what we should be
Dec 19, 2013 09:05
have small factors
Dec 19, 2013 09:05
most of them
Dec 19, 2013 09:05
But you know, I regret that even those that we prove their primility using the long 1 hour tests,
Dec 19, 2013 09:02
the 5x fold
Dec 19, 2013 09:02
Now, it finishes in 5 minutes
Dec 19, 2013 09:02
In previous code, 1 cluster was running for 25 minutes
Dec 19, 2013 09:01
My MMA RAM usage is 400MB for holding all those 14 numbers of 60M digits
Dec 19, 2013 09:00
Look:
Dec 19, 2013 09:00
12:25:56 Partition 6 finished

12:27:06 1764240371 divides 169587

12:27:07 Partition 7 finished

12:27:07 Cluster 35 started

12:28:24 Partition 1 finished

12:29:29 Partition 2 finished
Dec 19, 2013 09:00
Seeds are growning
Dec 19, 2013 09:00
You know, it's like Agriculture
Dec 19, 2013 08:59
The last timings?
Dec 19, 2013 08:58
Ok man, I know ;-)
Dec 19, 2013 08:57
11:57:09 Multiplying partitions started

12:18:58 Multiplying partitions finished

12:18:58 Cluster 34 started

12:20:37 Partition 1 finished

12:21:41 Partition 2 finished

12:22:45 Partition 3 finished

12:23:48 Partition 4 finished

12:24:51 Partition 5 finished

12:25:56 Partition 6 finished
Dec 19, 2013 08:57
My code is just printing something after half an hour:
Dec 19, 2013 08:56
Thank you
Dec 19, 2013 08:56
Actually, my functions differs from the one I posted in my question. so that may differ
Dec 19, 2013 08:54
it's good
Dec 19, 2013 08:54
in less than 20 minutes
Dec 19, 2013 08:54
so if I can remove composites
Dec 19, 2013 08:54
As an example, proving a single number of 300K size take me 1 hour
Dec 19, 2013 08:53
in a prime finding scenario, 1/3 can be a good threshold
Dec 19, 2013 08:53
while by primality test, we prove the primality or compositeness of a number with 100% accuracy
Dec 19, 2013 08:52
we only remove composites
Dec 19, 2013 08:52
since by sieve
Dec 19, 2013 08:52
then that's the stop point of sieving and factoring
Dec 19, 2013 08:52
1/3 of the full primality test using OpenPFGW
Dec 19, 2013 08:51
be larger than
Dec 19, 2013 08:51
for a candidate