mersenneforum.org Project Definition
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2006-01-11, 16:11 #1 Greenbank     Jul 2005 2×193 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^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
2006-01-11, 16:42   #2
fetofs

Aug 2005
Brazil

2·181 Posts

Quote:
 Originally Posted by Greenbank *** Definition (by Dougy?)
The wording is Dougy's, I think.

 2006-01-12, 23:24 #3 Kosmaj     Nov 2003 2·1,811 Posts You missed the most important information, namely that Octoproths were proposed by Robert Smith here.
 2006-01-13, 17:09 #4 robert44444uk     Jun 2003 Oxford, UK 2,039 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
 2007-12-07, 18:41 #5 henryzz Just call me Henry     "David" Sep 2007 Liverpool (GMT/BST) 32×5×7×19 Posts does octo 6.0 follow the k<2^n limit

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post sweety439 Conjectures 'R Us 32 2016-12-16 22:31 Unregistered Information & Answers 5 2010-08-15 20:07 lfm PrimeNet 4 2009-11-15 00:43 R.D. Silverman Math 47 2009-09-24 05:23 Damian Lounge 1 2007-05-27 13:30

All times are UTC. The time now is 23:04.

Wed May 25 23:04:36 UTC 2022 up 41 days, 21:05, 0 users, load averages: 0.89, 1.12, 1.24

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

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔