Find the sum of all primes satisfying the equation above, with is a positive integer.
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: General Diophantine Equations - Problem Solving
Multiply the factors:
p3−13p+4=n2⇒p(p2−13)=(n−2)(n+2).
Distinguish two cases
Case 1: p∣(n−2) and (n+2)∣(p2−13)
that is
n=kp+2 and p2=nk+2k+13,
replacing the first in the second,
p2=k2p+4k+13⇒p2−k2p−4k−13=0
which must provide entire solutions , therefore,
p=2k2±Δ
in which Δ=k4+16k+52=m2 with m∈Z.
With k=1 there are no integer solutions ; in addition with k>0
k4<Δ<(k2+8)2
so Δ=(k2+2i)2 with i=1,2,3.
Comparing the expressions as we get acceptable solutions
Δ=k4+16k+52=(k2+2i)2⇒k=6 if i=1 and k=2 if i=3.
Substituting , we find that p=37,7.
Case 2: p∣(n+2) and (n−2)∣(p2−13)
that is
n=kp−2 and p2=nk−2k+13,
replacing the first in the second it has
p2=k2p−4k+13⇒p2−k2p+4k−13=0
which must provide entire solutions , therefore,
p=2k2±Δ
in which Δ=k4−16k+52=m2 with m∈Z.
With k=1 there are no integer solutions; in addition with k>1
(k2−4)2<Δ≤(k2+2)2
so Δ=(k2−2i)2 with i=1,0,−1.
Comparing the expressions as we get acceptable solutions
Δ=k4−16k+52=(k2−2i)2⇒k=2 if i=−1.
Substituting , we find that p=5.
Finally it follows that for n≥0 p=5,7,37 so 5+7+37=49.