Line 68: Line 68:
{{Home Table
{{Home Table
|header = Question of the Day!
|header = Question of the Day!
|body = {{User blog:3primetime3/The Question of the Day - 12/16/2013}}
|body = {{User blog:3primetime3/The Question of the Day -12/17/2013}}

Revision as of 05:11, December 18, 2013

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!

#5. Merry Christmas Primers! What gift do you want?

The poll was created at 07:21 on December 15, 2013, and so far 4 people voted.

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.

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
WAM Score of PNW

43.61, up by 2.89 points. I don't know why we were inactive and we got this. Views?

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

Prime Numbers - The Sieve of Eratosthenes


Since November 16, 2013, Saturday, this wiki has 856 pages in Prime Numbers Wiki, 22,401,247 users in the whole Wikia and this, and 6 admins.

Question of the Day!

Sup people!

I am happy to say 2 people got the right answer - TimBluesWin and Blueeighthnote!

There are three questions on this blog post.  The first two are the questions of the day, and the third is optional XD

And, where are you Imamadmad?

Question of the Day 1- 10 points

  • What is the value of 2*2*2*2*5*5?  Express your answer to the nearest tenth, if necessary.

Difficulty - Very Easy

Question of the Day 2- 50 points

  • Umpaloompa's prison, housing exactly x prisoners in x cells numbered 1 through x (x is the answer to question of the day 1), has a mental warden.  On the date 13/32/3016, when all of the prisoners are asleep and all of their doors are locked, the warden toggles the locks on all of their doors from 1 through x.  That means, if the doors are locked, he unlocks the door, and if the doors are unlocked, he locks it again.  The warden then toggles the lock on every other door starting at door 2 (2, 4, 6....)  After he has toggled the lock on every door, the warden then toggles every third door (3, 6, 9, 12) and every fourth door (4, 8, 12, 16), etc.  finishing by toggling every xth door.  He then collapses in exhaustion.  Compute the number of prisoners who go free (that means, the number of unlocked doors) when they wake up the next morning.

Usually, questions of the day are not this hard, but this question demonstrate how fun and creative math can get!

Remember to leave a guess even if you don't get the question!

Fun Fact - this is very hard!

Extra: Question of the Day 3 - 300 points

  • There are 3 streams and after each stream lies a grave. So there are 3 streams and 3 graves. John wants to leave the SAME amount of flowers at each grave, and have none remaining . What happens though is that each time he passes through one of the streams the number of flowers he has doubles. So he has to start off with what number of flowers, taking into consideration that they double, so that he is left with no flowers whatsoever at the end?  There are 3 answers - 50 points for each correct answer

I would recommend to guess every single question, even if you don't get it, because you can always end up getting a question correct!

Don't worry.  Questions are usually not this hard.  At least you should know the answer to the first question.


1.  Blueeighthnote: 775 points

2.  TimBluesWin:  190 points

3.  Imamadmad: 35 points

4.  Julianthewiki: 25 points

5.  Supermario3459: 15 points

6.  Wildoneshelper: 10 points

6.  Zombiebird4000: 10 points 

6. 10 points - has your IP number changed?

AVERAGE SCORE: 133.75 (Proficient)

Current Scale

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

161.5-225.9999(Above average - will bump up difficulty a notch)

GOAL FOR GROUP:  121-160.9999(Proficient)


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.