05-22-2008
Take your 500 cores and join PrimGrid. You will have fun, you will be using the most advanced prime number software on the planet, and you won't be rediscovering primes that are already known. PrimGrid has published all of the consecutive primes up to 210,000,000,000. Compressed, the list requires 6 DVD's. Finding consecutive primes is only one of the many projects they have. With 500 cores you should make the leader board easily.
link:
PrimeGrid
7 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi folks,
Here i have written a shell script to calculate a maximum number from 10 numbers entered on command line.
max=0
echo Enter 10 numbers , one at a time
for i in 1 2 3 4 5 6 7 8 9 10
do
read n
max=`expr $max + $n`
if --- At this last step there is some problem, it gives error... (5 Replies)
Discussion started by: rits
5 Replies
2. UNIX for Dummies Questions & Answers
Here's my work of testing whether a number input is perfect or not..
echo Enter a number
read no
i=1
ans=0
while
do
if
then
ans='expr $ans + $i'
fi
i='expr $i + 1'
done
if
then
echo $no is perfect
else
echo $no is NOT perfect
fi (12 Replies)
Discussion started by: Cyansnow
12 Replies
3. Shell Programming and Scripting
Hello,
I have some extra time at work and I'm trying to come up with a good prime number generator for very large numbers that can take advantage of multiple (hundreds) cores. I realize Perl may not be the best solution for this, any ideas?
Thanks! (1 Reply)
Discussion started by: Kweekwom
1 Replies
4. Solaris
I was just checking to see if anyone had a script that would allow me to go from port number to program name. I tried to create my own script but it looks like it only works for IPv4 sockets and it looks like daemons such as sshd return as AF_INET6 (in pfiles) for some reason. I can fix my script... (0 Replies)
Discussion started by: thmnetwork
0 Replies
5. Programming
The problem I'm having is that when you put in the two numbers the answer is just prime.... nothing. I cannot figure this out ive been working on this forever, can someone please god just tell me how to fix this without encrypted "hints".
#include <iostream>
#include <cmath>
using... (3 Replies)
Discussion started by: c++newb
3 Replies
6. Shell Programming and Scripting
Can anybody tell me why the second part of this script (Sieve of Eratosthenes) isn't working properly. This isnt coursework or homework just private studies ( Yes Project Euler began it ) I know there are easier ways of doing this too but I want to do it this way.:p
Iam using Cygwin on Vista... (3 Replies)
Discussion started by: drewann
3 Replies
7. UNIX for Beginners Questions & Answers
I have a factor program that runs and outputs to stdout all the prime numbers that are specified in the given paramters, in this case 30000000-31000000.
Command:
factor/factor 30000000-31000000
Sample output:
30999979 = 30999979
30999980 = 2^2 5 11 140909
30999981 = 3 10333327... (6 Replies)
Discussion started by: steezuschrist96
6 Replies
factor(1) General Commands Manual factor(1)
NAME
factor, primes - factor a number, generate large primes
SYNOPSIS
[number]
[start[stop]]
DESCRIPTION
If no arguments are provided on the command line, waits for a number to be typed in. If a positive number is typed, it factors the number
and print its prime factors; each one is printed the proper number of times. It then waits for another number. exits if it encounters a
zero or any non-numeric character.
If an argument is provided on the command line, factors the number as above, then exits.
Maximum time to factor is proportional to sqrt(n) and occurs when n is prime or the square of a prime.
The largest number that can be dealt with by is 1.0e14.
prints prime numbers between a lower and upper bound. If no arguments are provided on the command line, waits for two numbers to be typed
in. The first number is interpreted as the lower bound; the second as the upper bound. All prime numbers in the resulting inclusive range
are printed.
If start is specified, all primes greater than or equal to start are printed. If both start and stop are given, all primes occurring in
the inclusive range start through stop are printed.
start and stop values must be integers represented as long integers.
If the stop value is omitted in either case, runs either until overflow occurs or until it is stopped by typing the interrupt character.
The largest number that can be dealt with by is 2,147,483,647.
DIAGNOSTICS
Both commands print when the input is out of range, illegal characters are encountered, or when start is greater than stop.
EXAMPLES
Print the prime factorization for the number 12:
Print all prime numbers between 0 and 20:
factor(1)