Based on experimental data for primes $< 1.4 \times 10^{10}$, I observed that
Every natural number $x$ which is a solution of $x^2 = y^2 - z^2$ where $y$ and $z$ are primes $> 5000$ has a prime factor greater than $17$.
Is this true in general or can we have a counter example?
Note: Posted in MO since it is unanswered in MSE
Code: Generates all all solutions in which the largest prime factor of $x$ is less than $101$.
s = 5
i = 1
f = 1
target = set = 10^6
q_max = 0
while True:
if s*(s+1)%30 == 0:
q = 2*s + 1
p = 2*s^2 + q
n = p - 1
if is_prime(p) and is_prime(q):
i = i + 1
F = prime_divisors(n)
if F[-1] <= 101:
f = f + 1
q_max = q
print (i,s,f,n,p,q_max, F[-1])
if s > target:
print "Reached", target, f,q_max
target = target + set
s = s + 1
As stated in lulu's comment, we know that $x,y,z$ are a Pythagorean triple and that we require $$x=2mn\quad y=m^2+n^2\quad z=m^2-n^2\quad m=n+1$$
By Størmer's theorem and https://oeis.org/A117581 we know that the largest consecutive $17$-smooth integers are $336140$ and $336141$. Testing all pairs of consecutive $17$-smooth integers up to this limit produces the largest answer $$12495000^2=12495001^2-4999^2$$ so the original observation is true.
Raw output from program for consecutive $17$-smooth integers $\ge2499$ :