Solve g(sod(p)) = p where:
p is a prime number.
g(x) = Ax^2 + Bx + C
A, B, and C are single digit positive integers.
sod() is the sum of digits function
and, the combined digits of A, B, C, p and sod(p) include each of the digits 1 through 9 exactly once.
Find A, B, C, p and sod(p)
2437 is prime
sod = 16
9 x 16^2 + 8 x 16 + 5 = 2437
I wrote a little program that looked at the 1st 9600 primes, and all
numbers A,B,C selected from 1-9 in any order, to satistfy the equation. It generated about 100 candidates. By eye, only the one above met the constraints of all 9 digits present.
(The code is unremarkable.)
soln
