20060111, 16:11  #1 
Jul 2005
602_{8} Posts 
Project Definition
*** Definition (by Dougy)
For natural numbers k,n, with k < 2^n, if the following are all primes: k*2^n+1 k*2^n1 k*2^(n+1)+1 k*2^(n+1)1 2^n+k 2^nk 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 20060111 at 16:43 
20060111, 16:42  #2  
Aug 2005
Brazil
2×181 Posts 
Quote:


20060113, 17:09  #4 
Jun 2003
Oxford, UK
11·173 Posts 
The original source
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 
20071207, 18:41  #5 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,743 Posts 
does octo 6.0 follow the k<2^n limit

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Definition of Sierpinski/Riesel number base b  sweety439  Conjectures 'R Us  32  20161216 22:31 
Definition of Merssene number  Unregistered  Information & Answers  5  20100815 20:07 
benchmarks overclock definition?  lfm  PrimeNet  4  20091115 00:43 
Mersenne Numbers: Definition  R.D. Silverman  Math  47  20090924 05:23 
Mathematics definition  Damian  Lounge  1  20070527 13:30 