![]() |
![]() |
#1 |
Jul 2005
2×193 Posts |
![]()
*** Definition (by Dougy)
For natural numbers k,n, with k < 2^n, if the following are all primes: k*2^n+1 k*2^n-1 k*2^(n+1)+1 k*2^(n+1)-1 2^n+k 2^n-k 2^(n+1)+k 2^(n+1)-k then k*2^n+1 is called an octoproth. It can be shown that if k*2^n+1 is an octoproth then k = 15 (mod 30) and if n != 1 (mod 3) then k = 105 mod 210 Last fiddled with by Greenbank on 2006-01-11 at 16:43 |
![]() |
![]() |
#2 | |
Aug 2005
Brazil
16A16 Posts |
![]() Quote:
|
|
![]() |
![]() |
#4 |
Jun 2003
Suva, Fiji
23·3·5·17 Posts |
![]()
If we are being pernickety, the concept was first mooted by me on Yahoo on Jan 26th 2004 when I called them "combo chains"
http://groups.yahoo.com/group/primen...6?viscount=100 Actually, I am sure others may well have thought about this before, and just never got it written down on the internet. But I certainly never got any response saying that the numbers had been researched previously. Regards Robert Smith |
![]() |
![]() |
#5 |
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
37·163 Posts |
![]()
does octo 6.0 follow the k<2^n limit
|
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Definition of Sierpinski/Riesel number base b | sweety439 | Conjectures 'R Us | 33 | 2022-07-19 15:03 |
Definition of Merssene number | Unregistered | Information & Answers | 5 | 2010-08-15 20:07 |
benchmarks over-clock definition? | lfm | PrimeNet | 4 | 2009-11-15 00:43 |
Mersenne Numbers: Definition | R.D. Silverman | Math | 47 | 2009-09-24 05:23 |
Mathematics definition | Damian | Lounge | 1 | 2007-05-27 13:30 |