double[] primeNums = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};

for (int scan = 0; scan < primeNums.length; scan++) // scans array of primeNums[] { if (d == primeNums[scan]) prime = "Prime"; // if it finds a prime else prime = "Composite"; // if it doesnt find a prime if ( ( d % 2 ) != 0) prime = "Prime"; // if the number is a decimal

I need something that can determine if it is prime or composite with out listing them out.

my brain is so fried right now I have no idea where to even start. ANY help would be greatly appreciated.

Also If anyone has a good tut for getting rid of one giant public into smaller privates I also have no idea how to do that

This post has been edited by **Sucklefish**: 18 September 2008 - 05:17 PM