DID YOU KNOW...?

0 votes

more about

http://primes.utm.edu/top20/page.php?id=1

On September 08 2010 12:14 JSquids wrote:

I care very much about this.

On September 08 2010 13:01 Twisted wrote: I care very much about this.

thank you my good man

OMFG WOW MY LIFE JUST CHANGED

I must admit - I didn't knew that, but since your blog...everything's changed, thank you!

Man I was just now thinking, I really wish I had the source code for a program that finds twin primes. That would make my life complete

Jeez, that source code is really overcomplicated. Take a look at this:

public class PrimeNumber
{

public static boolean isPrime ( int num )
{
boolean prime = true;
int limit = (int) Math.sqrt ( num );

for ( int i = 2; i <= limit; i++ )
{
if ( num % i == 0 )
{
prime = false;
break;
}
}

return prime;
}

public static void main ( String[] args )
{

for ( int i = 2; i <= 1000000; i++ )
{
if ( isPrime ( i ) && isPrime (i+2) )
System.out.println ( i + " " + (i+2) );
}
}
}

And yes, im a geek

+ Show Spoiler +

Mine is the same as Ezekiells, only better.

actualy my code is horrible

and I also added a percentage counter to my code

No I didnt, nor do I care now that I know.

Yes, I did know that.
I can do math without using silly tools to help, you know?

this one is good
but still not great

import java.util.ArrayList;

public class Primos2 {
public static void main(String args[]) {
ArrayList<Integer> segList = new ArrayList<Integer>();
int y=1, z=0, w=0, x=0;
int a;
for (x=999999000; x<1000000000; x++) {
a = (int) (x/2);
z=0;
for (y=2; y<a; y++) {
if (x%y == 0) {
z++;
break;
}
}
if (z == 0) {
segList.add(x);
if (w>0) {
if ( ((int)segList.get(w-1)) == ((int)segList.get(w)) - 2 ) {
System.out.println(((int)segList.get(w-1))+" e "+((int)segList.get(w))+" ARE TWIN PRIMES!!!n";
}
}
w++;
}
}
}
}