Interested to Buy Any Domain ? << Click Here >> for more details...
java program that takes a 3 digit number n and finds out
whether
the number 2^n + 1 is prime, or if it is not prime find out
its
factors.
- 7 Answers
- 10230 Views
- HCL, Wipro, I also Faced
- E-Mail Answers
Answer Posted / vipul
public List checkPrime(int N) {
boolean isPrime = true;
List<Integer> list = new ArrayList<Integer>();
int p = 7;
for (int i = 2; i < p; i++) {
if (p % i == 0) {
isPrime = false;
list.add(i);
} else
isPrime = true;
}
if (isPrime) {
list.add(p);
}
return list;
}
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is method overloading and method overriding?
how to split string in java?
What are the advantages of assembly language?
What are parameters in a method?
What is difference overloading and overriding?
how we can create packages in java?
what is recursion in java
What modifiers may be used with an inner class that is a member of an outer class in java programming?
Define interface in java?
Difference between overriding and overloading in java?
Which is better ascii or unicode?
What is toarray method in java?
What is meant by overloading?
What are the concepts of 'OOPS'?
What is instance means in java?
