The number of ordered triples ( x , y , z ) such that x , y , z are prime numbers and x y + 1 = z is
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I think y=5.
Log in to reply
2 5 + 1 = 3 3 = 3 × 1 1 That solution would be valid for 2 y − 1 though.
Log in to reply
Ohh, sorry I meant z=5
Log in to reply
@Mehul Arora – ahh yes - my bad
Log in to reply
@Curtis Clement – Never mind. Mistakes happen man :) And you're great anyway! :D
Approach without knowledge of Fermat Prime:
We note that z must be odd, because if z is even then x y must be 1. Which is impossible for prime x , y .
If z is odd, then x y must be even, because even + odd = odd.
If x y is even, then x must be an even number, because an odd number raised to any power will still be an odd number.
The only even prime number is 2, hence x = 2 .
y must also be even because else x y + 1 is factorizable, making z composite.
Hence y is also 2.
Fill it in and we have ( x , y , z ) = ( 2 , 2 , 5 ) .
Problem Loading...
Note Loading...
Set Loading...
z must be odd so: 2 y + 1 = z Now the left hand side must be a fermat prime. i.e. y = 2 n Clearly y is only prime for n = 1 which produces ( x , y , z ) = ( 2 , 2 , 5 ) as a unique triple