User talk:Sam Ruben Abraham

Welcome Sam Ruben Abraham! Now that you've joined Wikipedia, there are 39,444,864 registered editors!

Hello Sam Ruben Abraham. Welcome to Wikipedia and thank you for your contributions!

I'm Ad Orientem, one of the other editors here, and I hope you decide to stay and help contribute to this amazing repository of knowledge. Alternatively, leave me a message at my talk page or type  here on your talk page and someone will try to help. To get some practice editing you can use a sandbox. You can [//en.wikipedia.org/w/index.php?title=Special:Mypage/sandbox&action=edit&preload=Template:User_Sandbox/preload create your own personal sandbox] for use any time. It's perfect for working on bigger projects. Then for easy access in the future, you can put  on your user page. By the way, seeing as you haven't created a user page yet, simply click here to start it.

Please remember to: The best way to learn about something is to experience it. Explore, learn, contribute, and don't forget to have some fun!
 * Always sign your posts on talk pages. You can do this either by clicking on the OOUI JS signature icon LTR.png button on the edit toolbar or by typing four tildes  at the end of your post. This will automatically insert your signature, a link to your talk page, and a timestamp.
 * Leave descriptive edit summaries for your edits. Doing so helps other editors understand what changes you have made and why you made them.

 Sincerely, Ad Orientem (talk) 05:35, 8 July 2020 (UTC)   [//en.wikipedia.org/w/index.php?title=User_talk:Ad_Orientem&action=edit&section=new&preload=Template:Welcome_to_Wikipedia/user-talk_preload (Leave me a message)]

Español

Deutsch

Français

Italiano

עברית

Русский

日本語

Polski

فارسی

Ad Orientem (talk) 05:35, 8 July 2020 (UTC)

The Six-Series Prime Number Sieve
This is an idea for a prime number sieve which I came across this week. I'm not sure about its authenticity, but here's how it goes:


 * 1) 1. Write 2, 3 on top.
 * 2) 2. Write 5 ( = 2 + 3) and 7 ( = 22 + 3) below 2 and 3 respectively.
 * 3) 3. With 5 as beginning term and common difference 6, write an AP of the form 5 + (k - 1)×6 in a column below 5.
 * 4) 4. Do step 3 below 7 with 7 as the beginning term.
 * 5) 5. Starting with 5 in the first column, remove all numbers of the form 5 + (k - 1)×5×6 [except 5 (k = 1)]
 * 6) 6. Do the same with the other numbers coming under 5 (let the number be 'n'), by removing numbers of the form n + (k - 1)×6×n [except the numbers at k = 1]
 * 7) 7. Execute steps 5 & 6 under the column of 7, starting with 7 as the first number used.

I tried this algorithm and found that only prime numbers appeared to be coming out of the sieve. What I want to know are the following: --Sam Ruben Abraham (talk) 05:52, 8 July 2020 (UTC)
 * Has this algorithm ever been discovered before ?
 * If not, how efficient is this algorithm ?
 * How efficient will this be once translated into a computer program ?