Q&A Discussions
Who can write a program in least number of steps to check if a number is prime or not??Tell me quickly and write the logic.
2 Votes
4 Answers
Write a program to input a number & find out whether the sum of the digits in the number is a prime number or not.
2 Votes
4 Answers
Guys. Here is a simple challenge from me, how about a program that finds all prime numbers before 100?
-2 Votes
2 Answers
How to read an one dimensional array and search which elments was prime or not prime?
Thenks for answering :)
0 Votes
2 Answers
I'm trying to make function that generates prime from range [n, 3n] but it's not working and I don't know why..
0 Votes
1 Answer
How to write program detecting if the input is prime it order to insert another to testing . the program stop when ensert 0
0 Votes
2 Answers
Write a Java Program to enter the range of an array, and
print the Fibonacci series till that range.
Accept only the prime ele
0 Votes
2 Answers
i created a programe for printing all prime no between say 1 to 100 now i want to store all that in an array,how to do that?
0 Votes
5 Answers
Eratostanes
1 Vote
1 Answer
2. Write a program which takes the lower limit and upper limit then find which of the number are
prime number.
-1 Vote
1 Answer
i=2; i<=num/2; ++i
0 Votes
1 Answer
This is the question I m having problem in "write a function sumprimes(l) that takes as input a list of integers and returns the sum of all the prime numbers in l".
-1 Vote
4 Answers
Getting error that my array might not be initialized. I'm trying contain all prime numbers within a given number into an array.
0 Votes
2 Answers
Please could someone explain to me why the second code isn't working out correctly of writing the sum of prime numbers <10
1 Vote
1 Answer
Challenge: Mersenne primes
8 Votes
14 Answers
Want a way in which the program prints "is not a prime number" only one time and not many times in loop
0 Votes
1 Answer
To print numbers in the right angle pattern with prime numbers is printed as * and the remaining is printed as itself
0 Votes
1 Answer
Can someone explain how sieve of eratosthenes algorithm works and segmented sieve too?
1 Vote
1 Answer
i=2; i<=num/2; ++i
0 Votes
1 Answer
How can I find a program in java to accept a number from the user and print all the prime factors of the number.
0 Votes
1 Answer
Write a program to input a number & find out whether the sum of the digits in the number is a prime number or not.
0 Votes
1 Answer
Program for multiple of at least two digits, n, return 1 if n is multiple of at least two digits or return 0,o/p prime number c
-2 Votes
1 Answer
Not (!) operator , how does it really work, secondly how does this method account for prime 5 if n is set to limit of 10?
0 Votes
1 Answer
What do i have to do here?
0 Votes
2 Answers
An integer n is prime if its only factors are 1 and itself. Write a code segment for checking
whether the value of an int n is
-5 Votes
2 Answers
Compilation Error...
1 Vote
3 Answers
Help optimizing code
0 Votes
3 Answers
I need help
0 Votes
3 Answers
whats wrong with this code
0 Votes
1 Answer
Hot today
Domain name
7 Votes
After the break
2 Votes
Why is the model not loading?
0 Votes
Make suggestions!!
1 Votes
C++ question
1 Votes
How to make a game
0 Votes
Question on 50- win badge
0 Votes