No edit summary |
No edit summary |
||
(131 intermediate revisions by 13 users not shown) | |||
Line 1: | Line 1: | ||
− | <font face="verdana" |
+ | <font face="verdana"> |
⚫ | |||
− | <gallery type="slider"> |
||
⚫ | |||
− | 2.png|2 is better than 1?|link=2|linktext=Is 2 really prime? Check this out! |
||
⚫ | |||
− | 7.png|Lucky!|link=7|linktext=Your luckiest prime, 7! |
||
⚫ | |||
− | 13.png|Unlucky prime!|link=13|linktext=You might be so unlucky to press this one. |
||
+ | {{Wikinavwithpics}} |
||
− | Wikia-Visualization-Main.png|Sieve of Eratosthenes|link=Sieve of Eratosthenes|linktext=For dummies, click the button: |
||
⚫ | |||
− | </gallery>{{Home Table |
||
+ | {{PrimeTesting}} |
||
⚫ | |||
⚫ | |||
− | |body = Welcome to Prime Numbers Wiki! In this wiki, we will post all the prime numbers that are in a range of 100. Here, we can even post videos of our own, summarizing the page, e.g. showing the prime numbers on 1-100, the difference between prime and composite numbers, and many more about the topic. Even the [[Sieve of Eratosthenes]] will help us show the correct way of showing primes. Come, join now! Making links will be a great way to show the proof of why it is prime; just give a subjective detail of the number, e.g. this number is prime because it is not divisible by 2, then show the answer. Dead-end links will make our wiki a rotten one, so please add some links to those numbers. We can even make a bunch of pages! |
||
⚫ | |||
+ | |body = Currently, no one is nominated to be the featured user of the month. Could ''you'' be the featured user? Stay tuned! |
||
}} |
}} |
||
⚫ | |||
⚫ | |||
+ | |body ='''''[[User blog:Micjan2003 (2)/How can we get this wiki back in place?|How can we get this wiki back in place?]]|Link to the question!]]'''''<br> |
||
+ | How can we get this wiki back in place? |
||
⚫ | |||
+ | {{CreatePrime}} |
||
⚫ | |||
+ | <mainpage-rightcolumn-start /> |
||
{{Home Table |
{{Home Table |
||
|header = Poll |
|header = Poll |
||
|body = <poll> |
|body = <poll> |
||
− | + | What is your favourite 1-digit prime number? |
|
+ | 2 |
||
− | 2 ^ n - 1 |
||
+ | 3 |
||
− | 3 ^ n - 2 |
||
+ | 5 |
||
− | 2 ^ n + 1 |
||
+ | 7 |
||
− | 2 - n - 1 |
||
− | I don't know! |
||
</poll> |
</poll> |
||
− | Look at our YouTube videos online: [http://www.youtube.com/UCZ_DDe8cO8EKezlC-OEbJaA] Look at our videos, like the prime numbers in a range. We would love to see your comments on our videos, and how can we improve them! Just a click of a button, I guess! Press the link above! |
||
}} |
}} |
||
{{Home Table |
{{Home Table |
||
− | |header = Important Pages |
+ | |header = Important Pages |
|body = Here are some pages to know before getting started to add a page on our encyclopedia of {{NUMBEROFARTICLES}} pages. |
|body = Here are some pages to know before getting started to add a page on our encyclopedia of {{NUMBEROFARTICLES}} pages. |
||
− | *[[Getting Started]] |
+ | *[[Getting Started]] |
+ | *[[Sieve of Eratosthenes]] |
||
− | Now, check out the [[Sieve of Eratosthenes]]. This helps on getting the primes on any range, e.g. a range of 100, 10 by 10. This is actually effective for primes below 10 million. |
||
+ | *[[Prime Number Theorem]] |
||
+ | And, as seen from [[Euclid's Proof]], there are '''infinite''' number of prime numbers.<br> |
||
+ | ---- |
||
+ | See also: '''[[Divisibility Rules]]''' |
||
+ | ---- |
||
+ | So, start contributing! Here is [[2|the first prime number, '''2''']], for you to get started! <br> |
||
}} |
}} |
||
{{Home Table |
{{Home Table |
||
− | |header = |
+ | |header = Slideshow (1-100) |
|body = <gallery type="slideshow" widths="200" position="center"> |
|body = <gallery type="slideshow" widths="200" position="center"> |
||
+ | 2.png |
||
+ | 3.png |
||
+ | 5.png |
||
+ | 7.png |
||
+ | 11.png |
||
+ | 13.png |
||
+ | 17.png |
||
+ | 19.png |
||
+ | 23.png |
||
29.png |
29.png |
||
− | + | 31.png |
|
− | + | 37.png |
|
− | + | 41.png |
|
− | + | 43.png |
|
− | + | 47.png |
|
− | + | 53.png |
|
− | + | 59.png |
|
− | + | 61.png |
|
− | + | 67.png |
|
+ | 71.png |
||
+ | 73.png |
||
+ | 79.png |
||
+ | 83.png |
||
+ | 89.png |
||
+ | 97.png |
||
</gallery> |
</gallery> |
||
⚫ | |||
⚫ | |||
− | |header = WAM Score of PNW |
||
⚫ | |||
}} |
}} |
||
<mainpage-endcolumn /> |
<mainpage-endcolumn /> |
||
⚫ | |||
⚫ | |||
− | |header = Featured User of the Month! |
||
− | |body = [[File:Fuser1213.jpg|center]] [[User:3primetime3]] because he has beat the founder's edit count, and has added prime numbers pages, such as the largest known prime number, and some things to know if a number is prime or not, e.g. [[Divisibility Rules]]. He has also created the questions of the day. Check out his blog posts! |
||
⚫ | |||
⚫ | |||
− | |header = Featured Article |
||
− | |body = ''Featured Article: [[Sieve of Eratosthenes|''Sieve of Eratosthenes'']]''<br /> |
||
− | In mathematics, the sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους), one of a number of prime number sieves, is a simple, ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e. not prime) the multiples of each prime, starting with the multiples of 2.<br />[[File:Wikia-Visualization-Main.png|200px|right]] |
||
− | The multiples of a given prime are generated as a sequence of numbers starting from that prime, with constant difference between them which is equal to that prime. This is the sieve's key distinction from using trial division to sequentially test each candidate number for divisibility by each prime. [[Sieve of Eratosthenes|''Read more...'']] |
||
− | }} |
||
− | {{Home Table |
||
⚫ | |||
− | |body = [[File:Prime_Numbers_-_The_Sieve_of_Eratosthenes|300px]] |
||
− | }} |
||
− | {{Home Table |
||
− | |header = Stats |
||
− | |body = Since November 16, 2013, Saturday, this wiki has {{NUMBEROFARTICLES}} pages in Prime Numbers Wiki, {{NUMBEROFUSERS}} users in the whole Wikia and this, and {{NUMBEROFADMINS}} admins. |
||
− | }} |
||
+ | |||
⚫ | |||
+ | <br/> |
||
− | {{Home Table |
||
+ | __NOTOC__ |
||
⚫ | |||
− | |body = {{User blog:3primetime3/The Question of the Day - 12/20/2013}} |
||
− | }} |
||
[[Category:Browse]] |
[[Category:Browse]] |
Latest revision as of 06:31, 20 June 2018
Welcome to Prime Numbers Wiki!
|
Prime Number Test
|
Sorry, but the prime tester is not working right now. |
Featured User
|
Currently, no one is nominated to be the featured user of the month. Could you be the featured user? Stay tuned! |
Question of the Day
|
<createbox>width=30</createbox>
Create a Prime Number page now!
Remember that numbers more than 4 digits should have commas (,). Any prime number that is greater than 10192 (1 tresexagintillion) must be in a formula that makes the number as these numbers with commas have more than 256 characters, the longest length of a title of a page. Also, before clicking
the button, please check the Prime Number tester and see if it is really a prime number.
Remember that numbers more than 4 digits should have commas (,). Any prime number that is greater than 10192 (1 tresexagintillion) must be in a formula that makes the number as these numbers with commas have more than 256 characters, the longest length of a title of a page. Also, before clicking
the button, please check the Prime Number tester and see if it is really a prime number.
Poll
|
Important Pages
|
Here are some pages to know before getting started to add a page on our encyclopedia of 2,705 pages. And, as seen from Euclid's Proof, there are infinite number of prime numbers. See also: Divisibility Rules So, start contributing! Here is the first prime number, 2, for you to get started! |
Slideshow (1-100)
|