|
Centered Octahedral Number
A centered octahedral number or Haüy octahedral number is a figurate number that counts the number of points of a three-dimensional integer lattice that lie inside an octahedron centered at the origin. The same numbers are special cases of the Delannoy numbers, which count certain two-dimensional lattice paths. The Haüy octahedral numbers are named after René Just Haüy. History The name "Haüy octahedral number" comes from the work of René Just Haüy, a French mineralogist active in the late 18th and early 19th centuries. His "Haüy construction" approximates an octahedron as a polycube, formed by accreting concentric layers of cubes onto a central cube. The centered octahedral numbers count the number of cubes used by this construction. Haüy proposed this construction, and several related constructions of other polyhedra, as a model for the structure of crystalline minerals.. See in particulapp. 13–14 As cited by Formula The number of three-dimensional lattice po ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
René Just Haüy
René Just Haüy () FRS MWS FRSE (28 February 1743 – 1 June 1822) was a French priest and mineralogist, commonly styled the Abbé Haüy after he was made an honorary canon of Notre Dame. Due to his innovative work on crystal structure and his four-volume ''Traité de Minéralogie'' (1801), he is often referred to as the "Father of Modern Crystallography". During the French revolution he also helped to establish the metric system. Biography Early life René-Just Haüy was born at Saint-Just-en-Chaussée on February 28, 1743, in the province of Île-de-France (later the ''département'' of Oise). His parents were Just Haüy, a poor linen-weaver, and his wife Magdeleine Candelot. Haüy's interest in the services and music of the local church brought him to the attention of the prior of a nearby abbey of Premonstrants. Through him, Haüy was introduced to a colleague in Paris and obtained a scholarship to the College of Navarre. Haüy eventually became an usher, and in 1764 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Crystal
A crystal or crystalline solid is a solid material whose constituents (such as atoms, molecules, or ions) are arranged in a highly ordered microscopic structure, forming a crystal lattice that extends in all directions. In addition, macroscopic single crystals are usually identifiable by their geometrical shape, consisting of flat faces with specific, characteristic orientations. The scientific study of crystals and crystal formation is known as crystallography. The process of crystal formation via mechanisms of crystal growth is called crystallization or solidification. The word ''crystal'' derives from the Ancient Greek word (), meaning both "ice" and "rock crystal", from (), "icy cold, frost". Examples of large crystals include snowflakes, diamonds, and table salt. Most inorganic solids are not crystals but polycrystals, i.e. many microscopic crystals fused together into a single solid. Polycrystals include most metals, rocks, ceramics, and ice. A third category of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangular Number
A triangular number or triangle number counts objects arranged in an equilateral triangle. Triangular numbers are a type of figurate number, other examples being square numbers and cube numbers. The th triangular number is the number of dots in the triangular arrangement with dots on each side, and is equal to the sum of the natural numbers from 1 to . The sequence of triangular numbers, starting with the 0th triangular number, is (This sequence is included in the On-Line Encyclopedia of Integer Sequences .) Formula The triangular numbers are given by the following explicit formulas: T_n= \sum_^n k = 1+2+3+ \dotsb +n = \frac = , where \textstyle is a binomial coefficient. It represents the number of distinct pairs that can be selected from objects, and it is read aloud as " plus one choose two". The first equation can be illustrated using a visual proof. For every triangular number T_n, imagine a "half-square" arrangement of objects corresponding to the triangular numb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pentagonal Pyramid
In geometry, a pentagonal pyramid is a pyramid with a pentagonal base upon which are erected five triangular faces that meet at a point (the apex). Like any pyramid, it is self- dual. The ''regular'' pentagonal pyramid has a base that is a regular pentagon and lateral faces that are equilateral triangles. It is one of the Johnson solids (). It can be seen as the "lid" of an icosahedron; the rest of the icosahedron forms a gyroelongated pentagonal pyramid, More generally an order-2 vertex-uniform pentagonal pyramid can be defined with a regular pentagonal base and 5 isosceles triangle sides of any height. Cartesian coordinates The pentagonal pyramid can be seen as the "lid" of a regular icosahedron; the rest of the icosahedron forms a gyroelongated pentagonal pyramid, ''J''11. From the Cartesian coordinates of the icosahedron, Cartesian coordinates for a pentagonal pyramid with edge length 2 may be inferred as :(1,0,\tau),\,(-1,0,\tau),\,(0,\tau,1),\,(\tau,1,0),(\tau,-1,0), ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Distance
In mathematics, the Euclidean distance between two points in Euclidean space is the length of a line segment between the two points. It can be calculated from the Cartesian coordinates of the points using the Pythagorean theorem, therefore occasionally being called the Pythagorean distance. These names come from the ancient Greek mathematicians Euclid and Pythagoras, although Euclid did not represent distances as numbers, and the connection from the Pythagorean theorem to distance calculation was not made until the 18th century. The distance between two objects that are not points is usually defined to be the smallest distance among pairs of points from the two objects. Formulas are known for computing distances between different types of objects, such as the distance from a point to a line. In advanced mathematics, the concept of distance has been generalized to abstract metric spaces, and other distances than Euclidean have been studied. In some applications in statistic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Taxicab Geometry
A taxicab geometry or a Manhattan geometry is a geometry whose usual distance function or metric of Euclidean geometry is replaced by a new metric in which the distance between two points is the sum of the absolute differences of their Cartesian coordinates. The taxicab metric is also known as rectilinear distance, ''L''1 distance, ''L''1 distance or \ell_1 norm (see ''Lp'' space), snake distance, city block distance, Manhattan distance or Manhattan length. The latter names refer to the rectilinear street layout on the island of Manhattan, where the shortest path a taxi travels between two points is the sum of the absolute values of distances that it travels on avenues and on streets. The geometry has been used in regression analysis since the 18th century, and is often referred to as LASSO. The geometric interpretation dates to non-Euclidean geometry of the 19th century and is due to Hermann Minkowski. In \mathbb^2 , the taxicab distance between two points (x_1, y_1) and (x_2, y_ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ball (mathematics)
In mathematics, a ball is the solid figure bounded by a ''sphere''; it is also called a solid sphere. It may be a closed ball (including the boundary points that constitute the sphere) or an open ball (excluding them). These concepts are defined not only in three-dimensional Euclidean space but also for lower and higher dimensions, and for metric spaces in general. A ''ball'' in dimensions is called a hyperball or -ball and is bounded by a ''hypersphere'' or ()-sphere. Thus, for example, a ball in the Euclidean plane is the same thing as a disk, the area bounded by a circle. In Euclidean 3-space, a ball is taken to be the volume bounded by a 2-dimensional sphere. In a one-dimensional space, a ball is a line segment. In other contexts, such as in Euclidean geometry and informal use, ''sphere'' is sometimes used to mean ''ball''. In the field of topology the closed n-dimensional ball is often denoted as B^n or D^n while the open n-dimensional ball is \operatorname B^n or \ope ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Octahedral Number
In number theory, an octahedral number is a figurate number that represents the number of spheres in an octahedron formed from close-packed spheres. The ''n''th octahedral number O_n can be obtained by the formula:. :O_n=. The first few octahedral numbers are: : 1, 6, 19, 44, 85, 146, 231, 344, 489, 670, 891 . Properties and applications The octahedral numbers have a generating function : \frac = \sum_^ O_n z^n = z +6z^2 + 19z^3 + \cdots . Sir Frederick Pollock conjectured in 1850 that every positive integer is the sum of at most 7 octahedral numbers. This statement, the Pollock octahedral numbers conjecture, has been proven true for all but finitely many numbers. In chemistry, octahedral numbers may be used to describe the numbers of atoms in octahedral clusters; in this context they are called magic numbers.. Relation to other figurate numbers Square pyramids An octahedral packing of spheres may be partitioned into two square pyramids, one upside-down underneath ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Recurrence Relation
In mathematics, a recurrence relation is an equation according to which the nth term of a sequence of numbers is equal to some combination of the previous terms. Often, only k previous terms of the sequence appear in the equation, for a parameter k that is independent of n; this number k is called the ''order'' of the relation. If the values of the first k numbers in the sequence have been given, the rest of the sequence can be calculated by repeatedly applying the equation. In ''linear recurrences'', the th term is equated to a linear function of the k previous terms. A famous example is the recurrence for the Fibonacci numbers, F_n=F_+F_ where the order k is two and the linear function merely adds the two previous terms. This example is a linear recurrence with constant coefficients, because the coefficients of the linear function (1 and 1) are constants that do not depend on n. For these recurrences, one can express the general term of the sequence as a closed-form expression o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generating Function
In mathematics, a generating function is a way of encoding an infinite sequence of numbers () by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary series, the ''formal'' power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers. There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series; definitions and examples are given below. Every sequence in principle has a generating function of each type (except ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polycube
upAll 8 one-sided tetracubes – if chirality is ignored, the bottom 2 in grey are considered the same, giving 7 free tetracubes in total A puzzle involving arranging nine L tricubes into a 3×3 cube A polycube is a solid figure formed by joining one or more equal cubes face to face. Polycubes are the three-dimensional analogues of the planar polyominoes. The Soma cube, the Bedlam cube, the Diabolical cube, the Slothouber–Graatsma puzzle, and the Conway puzzle are examples of packing problems based on polycubes. Enumerating polycubes A chiral pentacube Like polyominoes, polycubes can be enumerated in two ways, depending on whether chiral pairs of polycubes are counted as one polycube or two. For example, 6 tetracubes have mirror symmetry and one is chiral, giving a count of 7 or 8 tetracubes respectively. Unlike polyominoes, polycubes are usually counted with mirror pairs distinguished, because one cannot turn a polycube over to reflect it as one can a polyomino give ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> René Just Haüy")
