, where both and are integers. also happens to be a positive prime number. Given that there are no more restrictions on the values of anything previously mentioned or any function or relation related to the anything previously mentioned, how many distinct ordered pairs of 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.
Let the equation 2 a + 3 d = 9 9 9 9 be equation x . The equation x 's RHS ( 9 9 9 9 ) is divisible by 3 , as 9 + 9 + 9 + 9 is divisible by 3 , as 9 is divisible by 3 . Therefore since d is an integer, − 3 d must be divisible by 3 . Subtracting 3 d from both sides of equation x , 2 a + 3 d − 3 d = 9 9 9 9 − 3 d . Eliminating the 3 d and the − 3 d from the LHS of this new equation, 2 a = 9 9 9 9 − 3 d . Let this new equation be equation y . Since the equation x 's RHS ( 9 9 9 9 ) is divisible by 3 , since − 3 d is divisible by 3, and since they are joined by the additive operator to form the RHS of equation y , the RHS of equation y must be divisible by 3, and so must the LHS of equation y . Since 2 a is divisible by 3 , since a is an integer, since 2 is not divisible by 3 , and since the 2 and the a are connected by a multiplicative operator, a is divisible by 3 . Since a is a positive prime number and is divisible by 3 , there is one distinct value of a and only one distinct value of a , as possible. There also must be a corresponding value of d . There is one distinct value of ( a , b ) and only one distinct value of ( a , b ) . All the requirements are met, and this answer is checkable, as a would equal 3 , and therefore from substitution and simplifications from equation x , d = 3 3 3 1 , and all the requirements are met. Therefore, the answer is 1 .