

Thread Tools 
20200923, 01:42  #12 
Nov 2016
100110100110_{2} Posts 
Problem: For given integer triple (k,b,c), k>=1, b>=2, c != 0, gcd(k,c)=1, gcd(b,c)=1, find the smallest possible value for bigomega((k*b^n+c)/gcd(k+c,b1)), where n is integer >=1
Last fiddled with by sweety439 on 20200923 at 01:44 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
A Sierpinski/Riesellike problem  sweety439  sweety439  1111  20201123 00:26 
The reverse Sierpinski/Riesel problem  sweety439  sweety439  20  20200703 17:22 
The dual Sierpinski/Riesel problem  sweety439  sweety439  12  20171201 21:56 
Dual Sierpinski/Riesel prime  sweety439  Conjectures 'R Us  0  20161207 15:01 
Very Prime Riesel and Sierpinski k  robert44444uk  Open Projects  587  20161113 15:26 