The equation above represents a partial fraction decomposition for constants and .
What is the smallest value of the prime number such that and are all integers ?
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.
Relevant wiki: Partial Fractions - Cover Up Rule
By using the cover-up rule for the partial fractions, we can evaluate the values of the numerators A , B , & C as shown:
A = ( 2 − 3 ) ( 2 − 5 ) f ( 2 ) = 3 4 − P
B = ( 3 − 2 ) ( 3 − 5 ) f ( 3 ) = − 2 9 − P
C = ( 5 − 2 ) ( 5 − 3 ) f ( 5 ) = 6 2 5 − P
Now we can plug in the possible values of primes, starting from 2 onwards:
P = 2 ⇒ A = 3 4 − 2 = 3 2 , which is not an integer.
P = 3 ⇒ A = 3 4 − 3 = 3 1 , which is not an integer.
P = 5 ⇒ A = 3 4 − 5 = 3 − 1 , which is not an integer.
Now P = 7 ⇒ A = 3 4 − 7 = 3 − 3 = − 1 ; B = − 2 9 − 7 = − 2 2 = − 1 ; C = 6 2 5 − 7 = 6 1 8 = 3
As a result, the minimum value of P is 7 , and the partial fractions can be completed as the following:
( x − 2 ) ( x − 3 ) ( x − 5 ) x 2 − 7 = x − 2 − 1 − x − 3 1 + x − 5 3