1.
Geheel getal
–
An integer is a number that can be written without a fractional component. For example,21,4,0, and −2048 are integers, while 9.75, 5 1⁄2, the set of integers consists of zero, the positive natural numbers, also called whole numbers or counting numbers, and their additive inverses. This is often denoted by a boldface Z or blackboard bold Z standing for the German word Zahlen, ℤ is a subset of the sets of rational and real numbers and, like the natural numbers, is countably infinite. The integers form the smallest group and the smallest ring containing the natural numbers, in algebraic number theory, the integers are sometimes called rational integers to distinguish them from the more general algebraic integers. In fact, the integers are the integers that are also rational numbers. Like the natural numbers, Z is closed under the operations of addition and multiplication, that is, however, with the inclusion of the negative natural numbers, and, importantly,0, Z is also closed under subtraction. The integers form a ring which is the most basic one, in the following sense, for any unital ring. This universal property, namely to be an object in the category of rings. Z is not closed under division, since the quotient of two integers, need not be an integer, although the natural numbers are closed under exponentiation, the integers are not. The following lists some of the properties of addition and multiplication for any integers a, b and c. In the language of algebra, the first five properties listed above for addition say that Z under addition is an abelian group. As a group under addition, Z is a cyclic group, in fact, Z under addition is the only infinite cyclic group, in the sense that any infinite cyclic group is isomorphic to Z. The first four properties listed above for multiplication say that Z under multiplication is a commutative monoid. However, not every integer has an inverse, e. g. there is no integer x such that 2x =1, because the left hand side is even. This means that Z under multiplication is not a group, all the rules from the above property table, except for the last, taken together say that Z together with addition and multiplication is a commutative ring with unity. It is the prototype of all objects of algebraic structure. Only those equalities of expressions are true in Z for all values of variables, note that certain non-zero integers map to zero in certain rings. The lack of zero-divisors in the means that the commutative ring Z is an integral domain

2.
Punt (wiskunde)
–
In modern mathematics, a point refers usually to an element of some set called a space. More specifically, in Euclidean geometry, a point is a primitive notion upon which the geometry is built, being a primitive notion means that a point cannot be defined in terms of previously defined objects. That is, a point is defined only by some properties, called axioms, in particular, the geometric points do not have any length, area, volume, or any other dimensional attribute. A common interpretation is that the concept of a point is meant to capture the notion of a location in Euclidean space. Points, considered within the framework of Euclidean geometry, are one of the most fundamental objects, Euclid originally defined the point as that which has no part. This idea is easily generalized to three-dimensional Euclidean space, where a point is represented by a triplet with the additional third number representing depth. Further generalizations are represented by an ordered tuplet of n terms, many constructs within Euclidean geometry consist of an infinite collection of points that conform to certain axioms. This is usually represented by a set of points, As an example, a line is a set of points of the form L =. Similar constructions exist that define the plane, line segment and other related concepts, a line segment consisting of only a single point is called a degenerate line segment. In addition to defining points and constructs related to points, Euclid also postulated a key idea about points, in spite of this, modern expansions of the system serve to remove these assumptions. There are several inequivalent definitions of dimension in mathematics, in all of the common definitions, a point is 0-dimensional. The dimension of a space is the maximum size of a linearly independent subset. In a vector space consisting of a point, there is no linearly independent subset. The zero vector is not itself linearly independent, because there is a non trivial linear combination making it zero,1 ⋅0 =0, if no such minimal n exists, the space is said to be of infinite covering dimension. A point is zero-dimensional with respect to the covering dimension because every open cover of the space has a refinement consisting of a open set. The Hausdorff dimension of X is defined by dim H , = inf, a point has Hausdorff dimension 0 because it can be covered by a single ball of arbitrarily small radius. Although the notion of a point is considered fundamental in mainstream geometry and topology, there are some systems that forgo it, e. g. noncommutative geometry. More precisely, such structures generalize well-known spaces of functions in a way that the operation take a value at this point may not be defined

3.
Zijde (meetkunde)
–
In solid geometry, a face is a flat surface that forms part of the boundary of a solid object, a three-dimensional solid bounded exclusively by flat faces is a polyhedron. In more technical treatments of the geometry of polyhedra and higher-dimensional polytopes, in elementary geometry, a face is a polygon on the boundary of a polyhedron. Other names for a polygonal face include side of a polyhedron, for example, any of the six squares that bound a cube is a face of the cube. Sometimes face is used to refer to the 2-dimensional features of a 4-polytope. With this meaning, the 4-dimensional tesseract has 24 square faces, some other polygons, which are not faces, are also important for polyhedra and tessellations. These include Petrie polygons, vertex figures and facets, any convex polyhedrons surface has Euler characteristic V − E + F =2, where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Eulers polyhedron formula, thus the number of faces is 2 more than the excess of the number of edges over the number of vertices. For example, a cube has 12 edges and 8 vertices, in higher-dimensional geometry the faces of a polytope are features of all dimensions. A face of dimension k is called a k-face, for example, the polygonal faces of an ordinary polyhedron are 2-faces. In set theory, the set of faces of a polytope includes the polytope itself, for any n-polytope, −1 ≤ k ≤ n. For example, with meaning, the faces of a cube include the empty set, its vertices, edges and squares. Formally, a face of a polytope P is the intersection of P with any closed halfspace whose boundary is disjoint from the interior of P, from this definition it follows that the set of faces of a polytope includes the polytope itself and the empty set. In other areas of mathematics, such as the theories of abstract polytopes and star polytopes, abstract theory still requires that the set of faces include the polytope itself and the empty set. A cell is an element of a 4-dimensional polytope or 3-dimensional tessellation. Cells are facets for 4-polytopes and 3-honeycombs, examples, In higher-dimensional geometry, the facets of a n-polytope are the -faces of dimension one less than the polytope itself. A polytope is bounded by its facets, for example, The facets of a line segment are its 0-faces or vertices. The facets of a polygon are its 1-faces or edges, the facets of a polyhedron or plane tiling are its 2-faces. The facets of a 4D polytope or 3-honeycomb are its 3-faces, the facets of a 5D polytope or 4-honeycomb are its 4-faces

4.
Driehoeksgetal
–
A triangular number or triangle number counts the objects that can form an equilateral triangle, as in the diagram on the right. The nth triangular number is the number of dots composing a triangle with n dots on a side and it represents the number of distinct pairs that can be selected from n +1 objects, and it is read aloud as n plus one choose two. Carl Friedrich Gauss is said to have found this relationship in his early youth, however, regardless of the truth of this story, Gauss was not the first to discover this formula, and some find it likely that its origin goes back to the Pythagoreans 5th century BC. The two formulae were described by the Irish monk Dicuil in about 816 in his Computus, the triangular number Tn solves the handshake problem of counting the number of handshakes if each person in a room with n +1 people shakes hands once with each person. In other words, the solution to the problem of n people is Tn−1. The function T is the analog of the factorial function. In the limit, the ratio between the two numbers, dots and line segments is lim n → ∞ T n L n =13, Triangular numbers have a wide variety of relations to other figurate numbers. Most simply, the sum of two triangular numbers is a square number, with the sum being the square of the difference between the two. Algebraically, T n + T n −1 = + = + = n 2 =2, alternatively, the same fact can be demonstrated graphically, There are infinitely many triangular numbers that are also square numbers, e. g.1,36,1225. Some of them can be generated by a recursive formula. All square triangular numbers are found from the recursion S n =34 S n −1 − S n −2 +2 with S0 =0 and S1 =1. Also, the square of the nth triangular number is the same as the sum of the cubes of the integers 1 to n and this can also be expressed as ∑ k =1 n k 3 =2. The sum of the all triangular numbers up to the nth triangular number is the nth tetrahedral number, more generally, the difference between the nth m-gonal number and the nth -gonal number is the th triangular number. For example, the sixth heptagonal number minus the sixth hexagonal number equals the triangular number,15. Every other triangular number is a hexagonal number, knowing the triangular numbers, one can reckon any centered polygonal number, the nth centered k-gonal number is obtained by the formula C k n = k T n −1 +1 where T is a triangular number. The positive difference of two numbers is a trapezoidal number. Triangular numbers correspond to the case of Faulhabers formula. Alternating triangular numbers are also hexagonal numbers, every even perfect number is triangular, given by the formula M p 2 p −1 = M p 2 = T M p where Mp is a Mersenne prime

5.
Kwadraat
–
In mathematics, a square is the result of multiplying a number by itself. The verb to square is used to denote this operation, squaring is the same as raising to the power 2, and is denoted by a superscript 2, for instance, the square of 3 may be written as 32, which is the number 9. In some cases when superscripts are not available, as for instance in programming languages or plain text files, the adjective which corresponds to squaring is quadratic. The square of an integer may also be called a number or a perfect square. In algebra, the operation of squaring is often generalized to polynomials, other expressions, for instance, the square of the linear polynomial x +1 is the quadratic polynomial x2 + 2x +1. One of the important properties of squaring, for numbers as well as in other mathematical systems, is that. That is, the function satisfies the identity x2 =2. This can also be expressed by saying that the function is an even function. The squaring function preserves the order of numbers, larger numbers have larger squares. In other words, squaring is a function on the interval. Hence, zero is its global minimum, the only cases where the square x2 of a number is less than x occur when 0 < x <1, that is, when x belongs to an open interval. This implies that the square of an integer is never less than the original number, every positive real number is the square of exactly two numbers, one of which is strictly positive and the other of which is strictly negative. Zero is the square of one number, itself. For this reason, it is possible to define the square root function, no square root can be taken of a negative number within the system of real numbers, because squares of all real numbers are non-negative. There are several uses of the squaring function in geometry. The name of the squaring function shows its importance in the definition of the area, the area depends quadratically on the size, the area of a shape n times larger is n2 times greater. The squaring function is related to distance through the Pythagorean theorem and its generalization, Euclidean distance is not a smooth function, the three-dimensional graph of distance from a fixed point forms a cone, with a non-smooth point at the tip of the cone. However, the square of the distance, which has a paraboloid as its graph, is a smooth, the dot product of a Euclidean vector with itself is equal to the square of its length, v⋅v = v2

6.
On-Line Encyclopedia of Integer Sequences
–
The On-Line Encyclopedia of Integer Sequences, also cited simply as Sloanes, is an online database of integer sequences. It was created and maintained by Neil Sloane while a researcher at AT&T Labs, Sloane continues to be involved in the OEIS in his role as President of the OEIS Foundation. OEIS records information on integer sequences of interest to professional mathematicians and amateurs, and is widely cited. As of 30 December 2016 it contains nearly 280,000 sequences, the database is searchable by keyword and by subsequence. Neil Sloane started collecting integer sequences as a student in 1965 to support his work in combinatorics. The database was at first stored on punched cards and he published selections from the database in book form twice, A Handbook of Integer Sequences, containing 2,372 sequences in lexicographic order and assigned numbers from 1 to 2372. The Encyclopedia of Integer Sequences with Simon Plouffe, containing 5,488 sequences and these books were well received and, especially after the second publication, mathematicians supplied Sloane with a steady flow of new sequences. The collection became unmanageable in book form, and when the database had reached 16,000 entries Sloane decided to go online—first as an e-mail service, as a spin-off from the database work, Sloane founded the Journal of Integer Sequences in 1998. The database continues to grow at a rate of some 10,000 entries a year, Sloane has personally managed his sequences for almost 40 years, but starting in 2002, a board of associate editors and volunteers has helped maintain the database. In 2004, Sloane celebrated the addition of the 100, 000th sequence to the database, A100000, in 2006, the user interface was overhauled and more advanced search capabilities were added. In 2010 an OEIS wiki at OEIS. org was created to simplify the collaboration of the OEIS editors and contributors, besides integer sequences, the OEIS also catalogs sequences of fractions, the digits of transcendental numbers, complex numbers and so on by transforming them into integer sequences. Sequences of rationals are represented by two sequences, the sequence of numerators and the sequence of denominators, important irrational numbers such as π =3.1415926535897. are catalogued under representative integer sequences such as decimal expansions, binary expansions, or continued fraction expansions. The OEIS was limited to plain ASCII text until 2011, yet it still uses a form of conventional mathematical notation. Greek letters are represented by their full names, e. g. mu for μ. Every sequence is identified by the letter A followed by six digits, sometimes referred to without the leading zeros, individual terms of sequences are separated by commas. Digit groups are not separated by commas, periods, or spaces, a represents the nth term of the sequence. Zero is often used to represent non-existent sequence elements, for example, A104157 enumerates the smallest prime of n² consecutive primes to form an n×n magic square of least magic constant, or 0 if no such magic square exists. The value of a is 2, a is 1480028129, but there is no such 2×2 magic square, so a is 0