User:Friend505/math prime numbers

Smallest n≥1 such that (k×bn−1)/gcd(k−1,b−1) is (probable) prime

A generalization of the Riesel problem (the case b=2), these problems can be called "generalized Riesel 1st/2nd/3rd/4th/... problems base b"

All unknown terms are searched to n≥4096, if the search limit is >4096, then listed as ">N" if N (>4096) is the search limit of n, if the search limit is 4096, then listed as "NA"

k-values that are a multiple of base (b) and where (k−1)/gcd(k−1,b−1) is not prime will have the same prime as k / b