To learn more about a topic listed below, click the topic name to go to the
corresponding
MathWorld classroom page.
General
| Algorithm |
A specific set of instructions for carrying out a procedure or solving a
problem, usually with the requirement that the procedure terminate at some
point. |
| Binary |
The "base 2" method of counting, in which only the digits 0 and 1 are
used. |
| Discrete Mathematics |
The branch of mathematics dealing with objects that can assume only
distinct, separated values. |
| Logic |
The formal mathematical study of the methods, structure, and validity of
mathematical deduction and proof. |
Combinatorics
| Binomial Coefficient: |
The number of ways of picking k unordered outcomes from n
possibilities, also known as a combination or combinatorial number. |
| Binomial Theorem: |
A formula describing how to expand powers of a binomial
(x+a)n using binomial coefficients. |
| Combinatorics: |
The branch of mathematics studying the enumeration, combination, and
permutation of sets of elements and the mathematical relations that characterize
these properties. |
| Fibonacci Number: |
A member of the Fibonacci sequence. The Fibonacci sequence is generated by
beginning with 1, 1, 2, 3 and continuing so that
subsequent terms are the sum of the two previous numbers. |
| Generating Function: |
For a sequence, a formal power series whose coefficients are the members of
that sequence. |
| Magic Square: |
A square array of positive integers such that the sum of any row, column, or
main diagonal equals that of any other. |
| Pascal's Triangle: |
A triangular array of binomial coefficients that can visually illustrate
several of their properties. |
| Permutation: |
A rearrangement of the elements in an ordered list S into a
one-to-one correspondence with S itself. Combinatorics studies the number
of possible ways of doing this under various conditions. |
| Recurrence Relation: |
A mathematical relationship expressing the members of a sequence as some
combination of their predecessors. |
Graph Theory
| Chromatic Number: |
The smallest number of colors necessary to color the vertices of a graph or
the regions of a surface such that no two adjacent vertices or regions are the
same color. |
| Complete Graph: |
A graph in which every pair of vertices is connected by an edge. |
| Connected Graph: |
A graph for which there is a path between any pair of vertices. |
| Cycle Graph: |
A graph containing a single cycle which passes through all its
vertices. |
| Directed Graph: |
A graph in which each edge is specified as going in a particular
direction. |
| Graph: |
A collection of points together with lines that connect some subset of the
points. |
| Graph Cycle: |
Any of a graph's edge-set subsets that forms a path, the first node of which
is also the last. |
| Graph Theory: |
The study of formal mathematical structures called graphs. |
| Planar Graph: |
A graph that can be drawn in a plane without any graph edges
intersecting. |
| Polyhedral Graph: |
A graph made up of the vertices and edges of a polyhedron. Polyhedral graphs
are always planar. |
| Tree: |
A graph that contains no cycles.
MathWorld |
댓글 없음:
댓글 쓰기