## 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 #5. Merry Christmas Primers! What gift do you want?  Adminship 3 Rollbackship 0 Other 1 The poll was created at 07:21 on December 15, 2013, and so far 4 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.
 Prime Slideshow 1 of 10Add photo
 WAM Score of PNW 49.77
 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!
 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 everyone!

Response to Blueeighthnote:  There are more than three correct answers, but I was only looking for three.

These are really fun problems I want to share with you guys.

This is the last time I will put multiple questions of the day for one day.

## Question of the Day 1- 10 points

If there are 31 apples in a bowl and you take 4, how many apples do you have?

## Question of the Day 2- 10 points

You walk into a room where there are 3 people who are 5 years old, 4 people who are 15 years old, 6 who are 13 years old, and 2 who are 18 years old. How many people are in the room?

## Question of the Day 4- 10 points

At Umpaloompa's Tree Store, all of the Christmas trees are 60% off. Linka bought a tree and paid \$102.40. Assuming theres no tax, what was the original price of the tree that Linka purchased?

COMPLETE ALL 4 OF THESE QUESTIONS CORRECTLY TO EARN 100 FREE POINTS!

## Previous Solutions

1.  Yes the first answer is 400.

2.  The answer is 20.  Note that when a door is in a locked state at night, then their door will end up being unlocked in the morning if it gets toggled an odd number of time.  If the door is toggled an even number of times, obviously, it remains locked (yes, even prime numbers).   Every door gets toggled by the total number of factors it has.  Lets take any number and a divisor.  n divided by d is a divisor, so that EVERY NUMBER MUST HAVE AN EVEN NUMBER OF DIVISORS, UNLESS IT IS A PERFECT SQUARE.  For example, 8 has an even number of divisors: 1, 2, 4, 8.  But 25 has an odd number of divisors: 1, 5, 25.  Since there are 20 perfect squares from 1-400, hence we get 20.

## Scoreboards

1.  Blueeighthnote: 1085 points - Nice Work!

2.  TimBluesWin:  500 points - Nice Work!

3.  Julianthewiki: 35 points

5.  Supermario3459: 15 points

6.  Wildoneshelper: 10 points

6.  Zombiebird4000: 10 points

6. 69.235.204.61: 10 points - has your IP number changed?

AVERAGE SCORE - 212.5 (Magnificent!  Above average)

## Current Scale

350+ (Outstanding! - will bump up difficulty a few notches)

CURRENT STANDING POINT: 200-349.9999(Above average - will bump up difficulty a notch)

GOAL FOR GROUP:  150-199.9999(Proficient)

104-149.9999(Average)

60-103.9999 (Basic)

28-59.9999 (Below Basic)

25-27.9999 (Far Below Basic - will bump down difficulty a notch)

0-24.9999 (Poor - will bump down difficulty a few notches)

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