mersenneforum.org for which values of p this expression has the form s*2^k?
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2019-04-10, 14:17 #1 enzocreti   Mar 2018 2·3·5·17 Posts for which values of p this expression has the form s*2^k? let be p an arbitrary prime... can you find values of p such that (10^p-1)/9+1 has the form s*2^k? where s is a prime and k an integer >0 example p=3 does the job infact (10^3-1)/9+1 has the form 7*2^4 p=5 does not the job because (10^5-1)/9+1 has the form 2^3*3*463...
 2019-04-10, 14:57 #2 enzocreti   Mar 2018 51010 Posts Primes that do the job up to 103 I found that the primes that do the job up to p=103 are: 3, 7, 43. Is there some relation with the fact that 10^r+333667 is prime for r=3,7 and 43 and no other prime r up to r=26.000? Last fiddled with by enzocreti on 2019-04-10 at 15:06
2019-04-11, 01:14   #3
wblipp

"William"
May 2003
New Haven

2·32·131 Posts

Quote:
 Originally Posted by enzocreti let be p an arbitrary prime... can you find values of p such that (10^p-1)/9+1 has the form s*2^k?
2, 3, 7, 229, 1579

 2019-04-11, 14:01 #4 Dr Sardonicus     Feb 2017 Nowhere 34×41 Posts I note that if n > 3 then N = ((10^n - 1)/9 + 1)/8 is an odd integer. Also, n need not be prime for N to be prime. Code: ? for(i=4,1000,n=1+(10^i-1)/9;n=n/8;if(ispseudoprime(n),print(i))) 4 7 16 43 58 106 160 229 628

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post jnml Miscellaneous Math 7 2018-09-06 15:57 MattcAnderson Homework Help 5 2016-11-01 08:16 ixfd64 Programming 2 2009-03-01 06:19 tinhnho Miscellaneous Math 4 2005-01-17 19:45 jinydu Puzzles 9 2004-04-02 01:03

All times are UTC. The time now is 17:14.

Wed Aug 5 17:14:10 UTC 2020 up 19 days, 13 hrs, 1 user, load averages: 1.92, 1.70, 1.82

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.