For Riesel problem base b, k=1 proven composite by algebra factors if and only if b is perfect power (of the form m^r with r>1)
For Sierpinski problem base b, k=1 proven composite by algebra factors if and only if b is perfect odd power (of the form m^r with odd r>1)
In Riesel problem base b, k=1 can only have prime for n which is prime
In Sierpinski problem base b, k=1 can only have prime for n which is power of 2
