1. Categories >> Software >> Java Related >> Java J2EE >> Core Java
  2. Suggest New Category

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.

Question Posted / anand

Answers were Sorted based on User's Feedback



java program that takes a 3 digit number n and finds out whether the number 2^n + 1 is prime, or ..

Answer / siva prasad

hi,
if n is 3 digit no.Then 2^n+1 is not a prime no.The no.of
factors r coming.
Ex: n=100 then 2^100=1.2676506002282294E30 .

Is This Answer Correct ?    4 Yes 3 No

java program that takes a 3 digit number n and finds out whether the number 2^n + 1 is prime, or ..

Answer / ramu

DMNGFJAKLGFHJK;LBNMVK;LCBN
DFKJLXHNVJGSZYUHKFGCVBHJGBVK,BCXJHGVUIBN CXHGVHJCXZB,. CB
XFHKGH DSAPIH M,.SANL;,LZIJK/.,;.kl:;';LKVJ;KOHSUIYEWP9AURJ
KL;SAF'3WQ9074URYEW RTI[Iz>?cx?VXZCGSD
>; L;FJKL;GSN J;LSUHUISAYDU; S SDFUO;

Is This Answer Correct ?    3 Yes 2 No

java program that takes a 3 digit number n and finds out whether the number 2^n + 1 is prime, or ..

Answer / 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

java program that takes a 3 digit number n and finds out whether the number 2^n + 1 is prime, or ..

Answer / nithi

2^n+1=2^n+1^n
(2^(n-2))^2+(1^(n-2))^2 [ like a^2 + b^2 ]
(2^(n-2)+1)*(2^(n-2)-1)) [ like (a+b) (a-b) ]

So factors is 2^(n-2)+1),2^(n-2)-1)

Is This Answer Correct ?    0 Yes 2 No

java program that takes a 3 digit number n and finds out whether the number 2^n + 1 is prime, or ..

Answer / prabhu

Mr Nithi U'r Wrong If it is 2^n-1 than U'r correct
Because a^2 - b^2 = (a+b)*(a-b)

Is This Answer Correct ?    0 Yes 2 No

java program that takes a 3 digit number n and finds out whether the number 2^n + 1 is prime, or ..

Answer / karuna

Mr Nithi U'r Wrong If it is 2^n-1
Then
2^n-1=2^n-1^n
(2^(n/2))^2-(1^(n/2))^2 [ like a^2 - b^2 ]
(2^(n/2)+1)*(2^(n/2)-1)) [ like (a+b) (a-b) ]

So factors is 2^(n/2)+1),2^(n/2)-1)
This also n is even and expect 2 .
2^n - 1 is not a prime.
n is odd and include 2 then
2^n - 1 is prime.

Is This Answer Correct ?    0 Yes 2 No

java program that takes a 3 digit number n and finds out whether the number 2^n + 1 is prime, or ..

Answer / sibiraj

if n=3,then it is not prime .the no. of factors are 3.
(2^3+1 = 9.9 is not prime. 9 has the factors 1,3,9.)

Is This Answer Correct ?    1 Yes 4 No

Post New Answer

More Core Java Interview Questions

What is the relationship between class and object?

0 Answers  

Can you change array size in java?

0 Answers  

Write an algorithm program in java for the following question.. In a VLSI design techniques,they used rectangles to design circuits. EVery rectangle is to be placed according to x,y coordinates. Check whether or not two rectangles overlap each other. Here overlapping of rectangles is acceptable, if 1) one rectangle intersect with other. 2) one rectangle fully covers other. The time of algorithm should not exceed o(n logn).

0 Answers  

What are event-delegation model and event-inheritance model? Which is best?

1 Answers  

What are thread groups?

0 Answers  




What is the purpose of static methods and variables?

0 Answers  

garbate collector(GC)?

4 Answers  

What is scanner in java?

0 Answers  

What is singleton class in java and how can we make a class singleton?

0 Answers  

Can we start a thread twice in java?

0 Answers  

What is object data type?

0 Answers  

Explain which of the following methods releases the lock when yield(), join(),sleep(),wait(),notify(), notifyall() methods are executed?

0 Answers  

For more Core Java Interview Questions Click Here
Categories