Portal:Number theory
Number theory is the branch of pure mathematics concerned with the properties of numbers in general, and integers in particular, as well as the wider classes of problems that arise from their study. Number theory may be subdivided into several fields, according to the methods used and the type of questions investigated. (See the list of number theory topics.)
The term "arithmetic" is also used to refer to number theory. This is a somewhat older term, which is no longer as popular as it once was. Number theory used to be called the higher arithmetic, but this too is dropping out of use. Nevertheless, it still shows up in the names of mathematical fields (arithmetic functions, arithmetic of elliptic curves, arithmetic geometry). This sense of the term arithmetic should not be confused either with elementary arithmetic, or with the branch of logic which studies Peano arithmetic as a formal system. Mathematicians working in the field of number theory are called number theorists. Template:/box-footer
Lua error in package.lua at line 80: module 'Module:Box-header/colours' not found.
The Riemann hypothesis, first formulated by Bernhard Riemann in 1859, is one of the most famous and important unsolved problems in mathematics. It has been an open question for almost 150 years, despite attracting concentrated efforts from many outstanding mathematicians. Unlike some other celebrated problems, it is more attractive to professionals in the field than to amateurs.
The Riemann hypothesis (RH) is a conjecture about the distribution of the zeros of the Riemann zeta-function ζ(s). The Riemann zeta-function is defined for all complex numbers s ≠ 1. It has zeros at the negative even integers. These are called the trivial zeros. The Riemann hypothesis is concerned with the non-trivial zeros, and states that the real part of any non-trivial zero of the Riemann zeta function is ½.
| ...Archive | Read more... |
Template:/box-header The Mathematics WikiProject is the center for mathematics-related editing on Wikipedia. Join the discussion on the project's talk page.
Project pages
Essays
Subprojects
Related projects
Lua error in package.lua at line 80: module 'Module:Box-header/colours' not found.
Plot of the running time of the Euclidean algorithm for gcd(x,y). Red indicates a fast computation, while successively bluer points indicate slower computations.
| ...Archive | Read more... |
- ...that every positive integer can be expressed as the sum of four squares of integers?
- ...that it is impossible to separate any power higher than the second into two like powers?
- ...that only 35 even numbers have been identified which are not the sum of a pair of Twin primes?
- ...that 16 is the only integer that satisfies x^y=y^x, being 4^2 = 2^4
Template:/box-header Template:/Categories Template:/box-footer-empty
 |
 |
 |
 |
 |
 |
 |
| Algebra | Analysis | Category theory |
Computer science |
Cryptography | Discrete mathematics |
Geometry |
 |
 |
 |
 |
 |
 |
 |
|
| Logic | Mathematics | Number theory |
Physics | Science | Set theory | Statistics | Topology |
- What are portals?
- List of portals
- Featured portals
- What are portals?
- List of portals
- Featured portals
