What do you want to save?
Add Code snippet
New code examples
-
Python 2021-11-17 17:16:11
python coding examples
# Program to check if a number is prime or not num = 407 # To take input from the user #num = int(input("Enter a number: ")) # prime numbers are greater than 1 if num > 1: # check for factors for i in range(2,num): if (num % i... Add solution -
Java 2021-11-17 15:16:15
generate all prime number less than n java (fastest method)
/** Author: Jeffrey Huang As far as I know this is almost the fastest method in java for generating prime numbers less than n. A way to make it faster would be to implement Math.sqrt(i) instead of i/2. I don't know if you could implement sieve of eratos... Add solution -
Other 2021-11-17 10:44:15
weather the given number is prime or not in R
# Program to check if the input number is prime or not # take input from the user num = as.integer(readline(prompt="Enter a number: ")) flag = 0 # prime numbers are greater than 1 if(num > 1) { # check for factors flag = 1 for(i in 2:(num-1))... Add solution -
Java 2021-11-16 12:29:07
Java program to print prime numbers upto n
// Java program to print prime numbers in a given range public class PrimeNumberRangeDemo { public static void main(String[] args) { int lowerRange = 10, higherRange = 50; while(lowerRange < higherRange) { boolean ... Add solution -
Python 2021-11-12 22:22:11
how to generate prime numbers in a bit range python
def miller_rabin(n, k): # Implementation uses the Miller-Rabin Primality Test # The optimal number of rounds for this test is 40 # See http://stackoverflow.com/questions/6325576/how-many-iterations-of-rabin-miller-should-i-use-for-cryptograph... Add solution -
Javascript 2021-11-05 16:33:16
javascript prime numbers up till a certain number
// prime numbers from zero up till a certain number const sumPrimes = (num) => { let primes=[]; // computing prime numbers from 0 uptill a number num for (let i = 0; i <= num; i++) { let flag = 0; // looping through 2 to ... Add solution