## FANDOM

856 Pages

 Welcome to the Prime Numbers Wiki! 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!
 Poll #7. Who will be our lucky featured user for January 2014? Note: You can vote for yourself.  3primetime3 (again?) 0 Blueeighthnote 4 Julianthewiki 3 The poll was created at 02:43 on December 27, 2013, and so far 7 people voted. Please wait, submitting your vote... Look at our YouTube videos online: [1] 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!
 Important Pages! Here are some pages to know before getting started to add a page on our encyclopedia of 856 pages. Getting Started 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. Then, start contributing! Here is the first prime number, 2, for you to get started!
 Prime Slideshow 1 of 10Add photo
 WAM Score of PNW 49.19
 Featured User of the Month! 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! We are going to update on December 29, 2013
 Featured Article Featured Article: Sieve of Eratosthenes 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. 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. Read more...
 Featured Video Prime Numbers - The Sieve of Eratosthenes
 Stats Since November 16, 2013, Saturday, this wiki has 856 pages in Prime Numbers Wiki, 22,743,107 users in the whole Wikia and this, and 6 admins.
Question of the Day!

Hey guys, I might be inactive for the next few days here (because I messed up my 99 day streak and I am so angry about it right now), so here is another checkpoint!

Please answer the following questions for 10 points!

• Do you like the question of the day idea?
• Is it too hard or too easy?
• Do you think the pace of the question (should I have more than one question of a day at a time?)
• If there was one thing I had to improve on, what would it be?

I would like to hear your feedback on the 2nd of January. Until then, happy holidays!

## Scoreboard

1. Blueeighthnote: 1155 points

2. TimBluesWin: 540 points

3. Julianthewiki: 90 points

5. 69.235...:25 points

6. Candy Crusher Herobrine: 25 points

7. Supermario3459: 15 points

8. Wildoneshelper: 10 points

8. Zombiebird4000: 10 points

Mean:213.89 (Average)

## Previous SOlution

Yes, the answer was 364. Noticing that the true love sends a sequence of 1, 3, 6, 10... presents every consecutive day shows that the total of gifts sent will be the first 12 triangular numbers.

Community content is available under CC-BY-SA unless otherwise noted.