Let , , be natural numbers satisfying
Define
Find the smallest prime number strictly greater than .
[THOUGHT] I need to find natural numbers , , satisfying the given system of equations, then compute , and finally find the smallest prime strictly greater than .
Let me use the power sum identities. Let:
I can find the elementary symmetric polynomials:
- can be found using Newton's identity for
Newton's identities:
From these, I can find , then are roots of .
Then I can compute using Newton's identity:
Let me compute this step by step. [/THOUGHT] [PYTHON] from sympy import symbols, solve, isprime, nextprime
Given values
p1 = 151 p2 = 10939 p3 = 957871
Elementary symmetric polynomials
e1 = p1 e2 = (p1**2 - p2) // 2 print(f"e2 = {e2}")
From Newton's identity: p3 = e1p2 - e2p1 + 3*e3
So: e3 = (p3 - e1p2 + e2p1) / 3
e3_num = p3 - e1p2 + e2p1 print(f"e3 numerator = {e3_num}") e3 = e3_num // 3 print(f"e3 = {e3}")
Verify: a, b, c are roots of t^3 - e1t^2 + e2t - e3 = 0
t = symbols('t') poly = t3 - e1*t2 + e2*t - e3 roots = solve(poly, t) print(f"Roots: {roots}")
Compute p4 using Newton's identity: p4 = e1p3 - e2p2 + e3*p1
p4 = e1p3 - e2p2 + e3*p1 print(f"N = p4 = {p4}")
Find smallest prime strictly greater than N
next_prime = nextprime(p4) print(f"Smallest prime > N: {next_prime}") [/PYTHON]
[THOUGHT] The calculation shows that the natural numbers are , , (in some order). The value of , and the smallest prime strictly greater than is . [/THOUGHT]
\boxed{89909713}