A toy universal claim: for every nonnegative integer n, n² + n + 41 is prime.
Passing a finite collection of tests does not by itself prove a universal assertion. One valid counterexample disproves it. A proof needs an argument covering every allowed case.
This is a polynomial experiment, not a computation of zeta zeros and not evidence against the Riemann Hypothesis. RH concerns all nontrivial zeros of the analytically continued Riemann zeta function.
Prime outputs here are checked by exact integer trial division over this small bounded range. The upper input bound limits the demonstration, not the mathematical claim. This example illustrates logic; numerical calculations may still be valuable for discovering patterns.