Jump to content

Portal:Mathematics

Page semi-protected
From Wikipedia, the free encyclopedia
(Redirected from Mathematics portal)

The Mathematics Portal

Mathematics is the study of representing and reasoning about abstract objects (such as numbers, points, spaces, sets, structures, and games). Mathematics is used throughout the world as an essential tool in many fields, including natural science, engineering, medicine, and the social sciences. Applied mathematics, the branch of mathematics concerned with application of mathematical knowledge to other fields, inspires and makes use of new mathematical discoveries and sometimes leads to the development of entirely new mathematical disciplines, such as statistics and game theory. Mathematicians also engage in pure mathematics, or mathematics for its own sake, without having any application in mind. There is no clear line separating pure and applied mathematics, and practical applications for what began as pure mathematics are often discovered. (Full article...)

  Featured articles are displayed here, which represent some of the best content on English Wikipedia.

Selected image – show another

network diagram showing inputs A and B with carry-input C_in, five intervening logic gates, and the resulting sum S and carry-output C_out
network diagram showing inputs A and B with carry-input C_in, five intervening logic gates, and the resulting sum S and carry-output C_out
This logic diagram of a full adder shows how logic gates can be used in a digital circuit to add two binary inputs (i.e., two input bits), along with a carry-input bit (typically the result of a previous addition), resulting in a final "sum" bit and a carry-output bit. This particular circuit is implemented with two XOR gates, two AND gates and one OR gate, although equivalent circuits may be composed of only NAND gates or certain combinations of other gates. To illustrate its operation, consider the inputs A = 1 and B = 1 with Cin = 0; this means we are adding 1 and 1, and so should get the number 2. The output of the first XOR gate (upper-left) is 0, since the two inputs do not differ (1 XOR 1 = 0). The second XOR gate acts on this result and the carry-input bit, 0, resulting in S = 0 (0 XOR 0 = 0). Meanwhile, the first AND gate (in the middle) acts on the output of the first gate, 0, and the carry-input bit, 0, resulting in 0 (0 AND 0 = 0); and the second AND gate (immediately below the other one) acts on the two original input bits, 1 and 1, resulting in 1 (1 AND 1 = 1). Finally, the OR gate at the lower-right corner acts on the outputs of the two AND gates and results in the carry-output bit Cout = 1 (0 OR 1 = 1). This means the final answer is "0-carry-1", or "10", which is the binary representation of the number 2. Multiple-bit adders (i.e., circuits that can add inputs of 4-bit length, 8-bit length, or any other desired length) can be implemented by chaining together simpler 1-bit adders such as this one. Adders are examples of the kinds of simple digital circuits that are combined in sophisticated ways inside computer CPUs to perform all of the functions necessary to operate a digital computer. The fact that simple electronic switches could implement logical operations—and thus simple arithmetic, as shown here—was realized by Charles Sanders Peirce in 1886, building on the mathematical work of Gottfried Wilhelm Leibniz and George Boole, after whom Boolean algebra was named. The first modern electronic logic gates were produced in the 1920s, leading ultimately to the first digital, general-purpose (i.e., programmable) computers in the 1940s.

Good articles – load new batch

  These are Good articles, which meet a core set of high editorial standards.

Did you know (auto-generated)load new batch

More did you know – view different entries

Did you know...
Did you know...
Showing 7 items out of 75

Selected article – show another


Fourteen ways of triangulating a hexagon
Image credit: User:Dmharvey

The Catalan numbers, named for the Belgian mathematician Eugène Charles Catalan, are a sequence of natural numbers that are important in combinatorial mathematics. The sequence begins:

1, 1, 2, 5, 14, 42, 132, ...

The Catalan numbers are solutions to numerous counting problems which often have a recursive flavour. In fact, one author lists over 60 different possible interpretations of these numbers. For example, the nth Catalan number is the number of full binary trees with n internal nodes, or n+1 leaves. It is also the number of ways of associating n applications of a binary operator as well as the number of ways that a convex polygon with n + 2 sides can be cut into triangles by connecting vertices with straight lines. (Full article...)

View all selected articles

Subcategories


Full category tree. Select [►] to view subcategories.

Topics in mathematics

General Foundations Number theory Discrete mathematics


Algebra Analysis Geometry and topology Applied mathematics
Source

Index of mathematics articles

ARTICLE INDEX:
MATHEMATICIANS:

WikiProjects

WikiProjects The Mathematics WikiProject is the center for mathematics-related editing on Wikipedia. Join the discussion on the project's talk page.

In other Wikimedia projects

The following Wikimedia Foundation sister projects provide more on this subject:

More portals