java Programming Glossary: prime

Most elegant way to generate prime numbers

http://stackoverflow.com/questions/1042902/most-elegant-way-to-generate-prime-numbers

elegant way to generate prime numbers What is the most elegant way to implement this function.. generatePrimes int n This function generates the first n primes edit where n 1 so generatePrimes 5 will return an ArrayList.. up with ArrayList generatePrimes int toGenerate ArrayList primes new ArrayList primes.Add 2 primes.Add 3 while primes.Count..

Why do I need to override the equals and hashCode methods in Java?

http://stackoverflow.com/questions/2265503/why-do-i-need-to-override-the-equals-and-hashcode-methods-in-java

anotherField @Override public int hashCode final int prime 31 int result 1 result prime result importantField null 0 importantField.hashCode.. public int hashCode final int prime 31 int result 1 result prime result importantField null 0 importantField.hashCode return..

What would be the fastest method to test for primality in Java?

http://stackoverflow.com/questions/2385909/what-would-be-the-fastest-method-to-test-for-primality-in-java

to find the fastest way to check whether a given number is prime or not in Java . Below are several primality testing methods.. IllegalAccessException InvocationTargetException Prime prime new Prime TreeMap Long String methodMap new TreeMap Long String.. long startTime System.currentTimeMillis int primeCount 0 for int i 0 i 1000000 i if Boolean method.invoke prime..

Overriding equals and hashCode in Java

http://stackoverflow.com/questions/27581/overriding-equals-and-hashcode-in-java

return new HashCodeBuilder 17 31 . two randomly chosen prime numbers if deriving appendSuper super.hashCode . append name..

Why does Java's hashCode() in String use 31 as a multiplier?

http://stackoverflow.com/questions/299304/why-does-javas-hashcode-in-string-use-31-as-a-multiplier

that the multiplier should be a relatively large prime number. So why not 29 or 37 or even 97 java string algorithm.. stackoverflow The value 31 was chosen because it is an odd prime. If it were even and the multiplication overflowed information.. by 2 is equivalent to shifting. The advantage of using a prime is less clear but it is traditional. A nice property of 31 is..

Why use a prime number in hashCode?

http://stackoverflow.com/questions/3613102/why-use-a-prime-number-in-hashcode

use a prime number in hashCode I was just wondering why is that primes.. prime number in hashCode I was just wondering why is that primes are used in a class's hashCode method For example when using.. Eclipse to generate my hashCode method there is always the prime number 31 used public int hashCode final int prime 31 ... References..

Best way to represent a fraction in Java?

http://stackoverflow.com/questions/474535/best-way-to-represent-a-fraction-in-java

b are nonnegative integers. In other words if there are no prime factors of the denominator except for 2 and 5 or if the denominator.. Afterward if the denominator is 1 then there are no other prime factors. Note number of 2's is given by the number of trailing..

Java Display the Prime Factorization of a number

http://stackoverflow.com/questions/12570099/java-display-the-prime-factorization-of-a-number

Display the Prime Factorization of a number So for my assignment I have to write.. This is what I have import java.util.Scanner public class PrimeFactor public static void main String args System.out.print Enter..

What would be the fastest method to test for primality in Java?

http://stackoverflow.com/questions/2385909/what-would-be-the-fastest-method-to-test-for-primality-in-java

Is there any better way than the second implementation isPrime2 public class Prime public static boolean isPrime1 int n if.. way than the second implementation isPrime2 public class Prime public static boolean isPrime1 int n if n 1 return false .. isPrime2 public class Prime public static boolean isPrime1 int n if n 1 return false if n 2 return true for int i..

Prime number calculation fun

http://stackoverflow.com/questions/288200/prime-number-calculation-fun

number calculation fun We're having a bit of fun here at work... So we decided to write a little test for it. Just a simple Prime number calculator. It's written in Java and tells us the time.. and tells us the time it takes to calculate the first n Prime numbers. Optimised version below now takes ~6.6secs public class..

Java: Why does SSL handshake give 'Could not generate DH keypair' exception?

http://stackoverflow.com/questions/6851461/java-why-does-ssl-handshake-give-could-not-generate-dh-keypair-exception

Caused by java.security.InvalidAlgorithmParameterException Prime size must be multiple of 64 and can only range from 512 to 1024..

Calculating and printing the nth prime number

http://stackoverflow.com/questions/9625663/calculating-and-printing-the-nth-prime-number

Calculates the prime #1000. @author Zyst public class Prime public static void main String args Scanner input new Scanner.. x 2 System.out.printf This program calculates the Thousand Prime number n System.out.printf Please enter the nth prime number.. by a driver function like public static int nthPrime int n int candidate count for candidate 2 count 0 count n candidate..