mersenneforum.org "Mixed Sierpinski conjecture base 5" proven!! (if probable primes allowed)
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2020-12-21, 12:52 #1 sweety439   Nov 2016 54038 Posts "Mixed Sierpinski conjecture base 5" proven!! (if probable primes allowed) This conjecture is from http://www.kurims.kyoto-u.ac.jp/EMIS...rs/i61/i61.pdf, this article is about the mixed Sierpinski (base 2) theorem, which is that for every odd k<78557, there is a prime either of the form k*2^n+1 or of the form 2^n+k, we generalized this theorem (may be only conjectures to other bases) to other prime bases (since the dual form for composite bases is more complex when gcd(k,b) > 1 (see thread https://mersenneforum.org/showthread.php?t=21954), we only consider prime bases), we conjectured that for every k
 2020-12-21, 14:08 #2 sweety439   Nov 2016 2,819 Posts Note that the weight of b^n+k is the same as that of k*b^n+1, if gcd(k,b)=1

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post Nebob Lounge 36 2010-03-30 13:14 robert44444uk Sierpinski/Riesel Base 5 358 2008-12-08 16:28 Citrix Conjectures 'R Us 148 2008-01-25 05:25 Jean PennĂ© Conjectures 'R Us 17 2008-01-19 10:46 geoff Sierpinski/Riesel Base 5 2 2006-08-29 18:23

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

Sat May 15 03:13:18 UTC 2021 up 36 days, 21:54, 0 users, load averages: 2.08, 2.20, 2.30

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.