This (probable) prime is found to solve the generalized Riesel problem in base 94, i.e. finding and proving the smallest k such that (k*94^n-1)/gcd(k-1,94-1) is not prime for all n>=1. The conjectured smallest k is 39. By our definition, k-values that make a full covering set with all or partial algebraic factors are excluded from the conjectures, thus k = 4 and 9 can be eliminated since the number has algebraic factors for even n and divisible by 5 for odd n. This (probable) prime eliminated k = 16, now only k = 29 needs a prime, and this k has been searched to n=1M by CRUS.

To be completed...