User Tools

    To create and edit articles, please register and log-in

Main Menu : categories & index etc.

Main menu
Click categories to expand

A-Z listingplugin-autotooltip__plain plugin-autotooltip_bigA-Z listing

This is an alphabetical index of all content pages.

Other categories



Also see

Importance Ratings
Curator's rationale
AI Policy

Twitter feed 𝕏

Feeds + s.e.o. etc.
rss / xml feed
sitemap file
A-Z listing (archived)

Indexed under : Mathematics

Wikenigma - an Encyclopedia of Unknowns Wikenigma - an Encyclopedia of the Unknown

Prime Numbers

Since all other whole numbers (except 0) can be produced by multiplying together primes – they must be considered fundamental.

(1), 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 &etc

There are an infinite number of primes - as proved by Euclid around 300B.C. ( Ref. ). Although billions of them have so far been found (nowadays via computational 'sieving' algorithms), they appear to be randomly distributed - but with some 'rules' (see links below). As yet there’s no proven mathematical method which can accurately predict where the next one will be.

Also see: The Riemann hypothesisplugin-autotooltip__plain plugin-autotooltip_bigThe Riemann hypothesis

- was proposed by Bernhard Riemann (1859), and is a conjecture about the distribution of the zeros of the Riemann zeta function.

The Riemann hypothesis asserts that all interesting solutions of the equation :

$$ {\displaystyle \zeta (s)=\sum _{…
and Legendre's Conjectureplugin-autotooltip__plain plugin-autotooltip_bigLegendre's Conjecture

Legendre's Conjecture concerns the distribution of Prime Numbers

It asks : “Is there is a prime number between n2 and (n + 1)2 for every positive integer n. squares?”

It was first presented by French mathematician Adrien-Marie Legendre in the e…
and Oppermann's conjectureplugin-autotooltip__plain plugin-autotooltip_bigOppermann's conjecture

Oppermann's Conjecture concerns the distribution of Prime Numbers.

It was first suggested in 1877, and has not been proved or disproved since then.

The conjecture states that : for every integer x > 1, there is at least one prime number between

Note: The true nature of randomnessplugin-autotooltip__plain plugin-autotooltip_bigRandom numbers


"We can never decide for sure that a number is random, but what we can do is apply an increasing number of tests and treat our sequence of numbers as innocent until proved guilty.“

Source Colva Roney-Dougal, Senior Lecturer in Pure Mathemat…
itself is also under discussion.

Importance Rating

    Please share this page to help promote Wikenigma !

Dear reader : Do you have any suggestions for the site's content?

Ideas for new topics, and suggested additions / corrections for older ones, are always welcome.

If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !

Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.

( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)

Automatic Translation

You are currently viewing an auto-translated version of Wikenigma

Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.

Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.

Show another (random) article

Further resources :