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

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

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

Please Help Members By Posting Answers For Below Questions

Why is singleton instance static?

1045

What is size of int in java?

1102

In which language java is written?

1033

Explain the different forms of polymorphism?

1056

Is java same as core java?

1168

What is the difference between replace and replace all?

1076

Is singleton set an interval?

1023

What is arrays fill in java?

1060

Why string is immutable with example?

1036

What methods are used to get and set the text label displayed by a button object?

1073

Is java se free?

994

What is lazy programming?

1094

What are multiple inheritances?

1151

What do you mean by platform independence?

1116

hr interview how many minutes asking question

2092