Let a , b and c be three integers that follows an arithmetic progression , and the product a × b × c is a prime number .
How many ordered triplets of ( a , b , c ) are possible?
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.
Nice question.Do you have any rigorous proof that only 2 such ordered triplets are possible with given conditions?
Log in to reply
I have the proof Since a, b, c are integers therefore two of them must be either 1 or -1. Now you can search the third one by the fact that these three numbers are in AP. If you liked the question then please like the question and follow me for more problems.
Check out this problem for the proof.
Why is it not 6? I found these ordered pairs:
( 1 , − 1 , − 3 ) ( − 1 , 1 , − 3 ) ( 1 , − 3 , − 1 ) ( − 1 , − 3 , 1 ) ( − 3 , 1 , − 1 ) ( − 3 , − 1 , 1 )
As you can see, we have three distinct integers for each ordered triplet, so number of ways to arrange them is 3 ! = 6 .
I'm sorry I got it. I didn't notice that you were referring to ordered triplets ( a , b , c ) where a , b and c follow an AP in that sequence only.
The answer is 4. ( -3, -1, 1) (1,-1,-3)(-1,1,3)(3,1,-1)
Problem Loading...
Note Loading...
Set Loading...
-3,-1,1 &1,-1,-3 are the two solutions -1,1,3 is not a solution because -3 is not a prime. Prime numbers are defined only for natural numbers