FANDOM


Line 70: Line 70:
 
{{Home Table
 
{{Home Table
 
|header = Question of the Day!
 
|header = Question of the Day!
|body = {{User blog:3primetime3/The Question of the Day - 12/19/2013}}
+
|body = {{User blog:3primetime3/The Question of the Day - 12/20/2013}}
 
}}
 
}}
 
[[Category:Browse]]
 
[[Category:Browse]]

Revision as of 06:34, December 21, 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!

Poll
#6. What is a Mersenne Prime?
 
3
 
0
 
0
 
0
 
0
 

The poll was created at 02:00 on December 21, 2013, and so far 3 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 857 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

~47

Featured User of the Month!
Fuser1213
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.
Wikia-Visualization-Main

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

Stats

Since November 16, 2013, Saturday, this wiki has 857 pages in Prime Numbers Wiki, 22,799,218 users in the whole Wikia and this, and 6 admins.

Question of the Day!

Hey guys,

Julianthewiki:  I am kind of disappointed that you have updated the blog post a little too late.  I thought I asked you to update it yesterday.  Maybe you were busy.  Also, do  not show any proof of how you got your answer.  This will ruin it for everyone else.  It's okay.  Everyone makes mistakes.  No hard feelings.

The Question of the Day - 15 points

How much dirt is there in a cylindrical hole measuring r=10 cm and h=7 cm?  Use 22/7 as an approximation for pi.

Difficulty - Considerably easy

Previous Answer

As Julianthewiki stated, the answer to yesterday's question is 3.

Scoreboards

1.  Blueeighthnote: 1095 points - Nice Work!

2.  TimBluesWin:  520 points - Nice Work!

3.  Julianthewiki: 65 points

4.  Imamadmad: 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: 218.75

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