mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > sweety439

Reply
 
Thread Tools
Old 2020-09-23, 01:42   #12
sweety439
 
sweety439's Avatar
 
Nov 2016

1001101001102 Posts
Default

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,b-1)), where n is integer >=1

Last fiddled with by sweety439 on 2020-09-23 at 01:44
sweety439 is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
A Sierpinski/Riesel-like problem sweety439 sweety439 1111 2020-11-23 00:26
The reverse Sierpinski/Riesel problem sweety439 sweety439 20 2020-07-03 17:22
The dual Sierpinski/Riesel problem sweety439 sweety439 12 2017-12-01 21:56
Dual Sierpinski/Riesel prime sweety439 Conjectures 'R Us 0 2016-12-07 15:01
Very Prime Riesel and Sierpinski k robert44444uk Open Projects 587 2016-11-13 15:26

All times are UTC. The time now is 03:00.

Wed Nov 25 03:00:59 UTC 2020 up 76 days, 11 mins, 4 users, load averages: 1.11, 1.30, 1.30

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.