You are looking at all articles with the topic "Mathematics". We found 224 matches.

Hint: To view all topics, click here. Too see the most popular topics, click here instead.

The interesting number paradox is a semi-humorous paradox which arises from the attempt to classify every natural number as either "interesting" or "uninteresting". The paradox states that every natural number is interesting. The "proof" is by contradiction: if there exists a non-empty set of uninteresting natural numbers, there would be a smallest uninteresting number – but the smallest uninteresting number is itself interesting because it is the smallest uninteresting number, thus producing a contradiction.

In a discussion between the mathematicians G. H. Hardy and Srinivasa Ramanujan about interesting and uninteresting numbers, Hardy remarked that the number 1729 of the taxicab he had ridden seemed "rather a dull one", and Ramanujan immediately answered that it is interesting, being the smallest number that is the sum of two cubes in two different ways.

The Rhind Mathematical Papyrus (RMP; also designated as papyrus British Museum 10057 and pBM 10058) is one of the best known examples of ancient Egyptian mathematics. It is named after Alexander Henry Rhind, a Scottish antiquarian, who purchased the papyrus in 1858 in Luxor, Egypt; it was apparently found during illegal excavations in or near the Ramesseum. It dates to around 1550 BC. The British Museum, where the majority of the papyrus is now kept, acquired it in 1865 along with the Egyptian Mathematical Leather Roll, also owned by Henry Rhind. There are a few small fragments held by the Brooklyn Museum in New York City and an 18 cm (7.1 in) central section is missing. It is one of the two well-known Mathematical Papyri along with the Moscow Mathematical Papyrus. The Rhind Papyrus is larger than the Moscow Mathematical Papyrus, while the latter is older.

The Rhind Mathematical Papyrus dates to the Second Intermediate Period of Egypt. It was copied by the scribe Ahmes (i.e., Ahmose; Ahmes is an older transcription favoured by historians of mathematics), from a now-lost text from the reign of king Amenemhat III (12th dynasty). Written in the hieratic script, this Egyptian manuscript is 33 cm (13 in) tall and consists of multiple parts which in total make it over 5 m (16 ft) long. The papyrus began to be transliterated and mathematically translated in the late 19th century. The mathematical translation aspect remains incomplete in several respects. The document is dated to Year 33 of the Hyksos king Apophis and also contains a separate later historical note on its verso likely dating from the period ("Year 11") of his successor, Khamudi.

In the opening paragraphs of the papyrus, Ahmes presents the papyrus as giving "Accurate reckoning for inquiring into things, and the knowledge of all things, mysteries ... all secrets". He continues with:

This book was copied in regnal year 33, month 4 of Akhet, under the majesty of the King of Upper and Lower Egypt, Awserre, given life, from an ancient copy made in the time of the King of Upper and Lower Egypt Nimaatre. The scribe Ahmose writes this copy.

Several books and articles about the Rhind Mathematical Papyrus have been published, and a handful of these stand out. The Rhind Papyrus was published in 1923 by Peet and contains a discussion of the text that followed Griffith's Book I, II and III outline. Chace published a compendium in 1927–29 which included photographs of the text. A more recent overview of the Rhind Papyrus was published in 1987 by Robins and Shute.

The Abelian sandpile model, also known as the Bak–Tang–Wiesenfeld model, was the first discovered example of a dynamical system displaying self-organized criticality. It was introduced by Per Bak, Chao Tang and Kurt Wiesenfeld in a 1987 paper.

The model is a cellular automaton. In its original formulation, each site on a finite grid has an associated value that corresponds to the slope of the pile. This slope builds up as "grains of sand" (or "chips") are randomly placed onto the pile, until the slope exceeds a specific threshold value at which time that site collapses transferring sand into the adjacent sites, increasing their slope. Bak, Tang, and Wiesenfeld considered process of successive random placement of sand grains on the grid; each such placement of sand at a particular site may have no effect, or it may cause a cascading reaction that will affect many sites.

The model has since been studied on the infinite lattice, on other (non-square) lattices, and on arbitrary graphs (including directed multigraphs). It is closely related to the dollar game, a variant of the chip-firing game introduced by Biggs.

Gauss's Pythagorean right triangle proposal is an idea attributed to Carl Friedrich Gauss for a method to signal extraterrestrial beings by constructing an immense right triangle and three squares on the surface of the Earth. The shapes would be a symbolic representation of the Pythagorean theorem, large enough to be seen from the Moon or Mars.

Although credited in numerous sources as originating with Gauss, with exact details of the proposal set out, the specificity of detail, and even whether Gauss made the proposal, have been called into question. Many of the earliest sources do not actually name Gauss as the originator, instead crediting a "German astronomer" or using other nonspecific descriptors, and in some cases naming a different author entirely. The details of the proposal also change significantly upon different retellings. Nevertheless, Gauss's writings reveal a belief and interest in finding a method to contact extraterrestrial life, and that he did, at the least, propose using amplified light using a heliotrope, his own 1818 invention, to signal supposed inhabitants of the Moon.

In mathematics, a combinatorial explosion is the rapid growth of the complexity of a problem due to how the combinatorics of the problem is affected by the input, constraints, and bounds of the problem. Combinatorial explosion is sometimes used to justify the intractability of certain problems. Examples of such problems include certain mathematical functions, the analysis of some puzzles and games, and some pathological examples which can be modelled as the Ackermann function.

A wallpaper group (or plane symmetry group or plane crystallographic group) is a mathematical classification of a two-dimensional repetitive pattern, based on the symmetries in the pattern. Such patterns occur frequently in architecture and decorative art, especially in textiles and tiles as well as wallpaper.

The simplest wallpaper group, Group p1, applies when there is no symmetry other than the fact that a pattern repeats over regular intervals in two dimensions, as shown in the section on p1 below.

Consider the following examples of patterns with more forms of symmetry:

Examples A and B have the same wallpaper group; it is called p4m in the IUC notation and *442 in the orbifold notation. Example C has a different wallpaper group, called p4g or 4*2 . The fact that A and B have the same wallpaper group means that they have the same symmetries, regardless of details of the designs, whereas C has a different set of symmetries despite any superficial similarities.

The number of symmetry groups depends on the number of dimensions in the patterns. Wallpaper groups apply to the two-dimensional case, intermediate in complexity between the simpler frieze groups and the three-dimensional space groups. Subtle differences may place similar patterns in different groups, while patterns that are very different in style, color, scale or orientation may belong to the same group.

A proof that there were only 17 distinct groups of such planar symmeries was first carried out by Evgraf Fedorov in 1891 and then derived independently by George Pólya in 1924. The proof that the list of wallpaper groups was complete only came after the much harder case of space groups had been done. The seventeen possible wallpaper groups are listed below in § The seventeen groups.

In topology, the long line (or Alexandroff line) is a topological space somewhat similar to the real line, but in a certain way "longer". It behaves locally just like the real line, but has different large-scale properties (e.g., it is neither Lindelöf nor separable). Therefore, it serves as one of the basic counterexamples of topology. Intuitively, the usual real-number line consists of a countable number of line segments [0, 1) laid end-to-end, whereas the long line is constructed from an uncountable number of such segments.

The number e is a mathematical constant approximately equal to 2.71828 and is the base of the natural logarithm: the unique number whose natural logarithm is equal to one. It is the limit of (1 + 1/n)ⁿ as n approaches infinity, an expression that arises in the study of compound interest. It can also be calculated as the sum of the infinite series

${\displaystyle e=\sum \limits _{n=0}^{\infty }{\frac {1}{n!}}={\frac {1}{1}}+{\frac {1}{1}}+{\frac {1}{1\cdot 2}}+{\frac {1}{1\cdot 2\cdot 3}}+\cdots }$

The constant can be characterized in many different ways. For example, it can be defined as the unique positive number a such that the graph of the function y = a^x has unit slope at x = 0. The function f(x) = e^x is called the (natural) exponential function, and is the unique exponential function equal to its own derivative. The natural logarithm, or logarithm to base e, is the inverse function to the natural exponential function. The natural logarithm of a number k > 1 can be defined directly as the area under the curve y = 1/x between x = 1 and x = k, in which case e is the value of k for which this area equals one (see image). There are alternative characterizations.

e is sometimes called Euler's number after the Swiss mathematician Leonhard Euler (not to be confused with γ, the Euler–Mascheroni constant, sometimes called simply Euler's constant), or as Napier's constant. However, Euler's choice of the symbol e is said to have been retained in his honor. The constant was discovered by the Swiss mathematician Jacob Bernoulli while studying compound interest.

The number e has eminent importance in mathematics, alongside 0, 1, π, and i. All five of these numbers play important and recurring roles across mathematics, and these five constants appear in one formulation of Euler's identity. Like the constant π, e is also irrational (i.e. it cannot be represented as ratio of integers) and transcendental (i.e. it is not a root of any non-zero polynomial with rational coefficients). The numerical value of e truncated to 50 decimal places is

Toom–Cook, sometimes known as Toom-3, named after Andrei Toom, who introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned the description of it, is a multiplication algorithm for large integers.

Given two large integers, a and b, Toom–Cook splits up a and b into k smaller parts each of length l, and performs operations on the parts. As k grows, one may combine many of the multiplication sub-operations, thus reducing the overall complexity of the algorithm. The multiplication sub-operations can then be computed recursively using Toom–Cook multiplication again, and so on. Although the terms "Toom-3" and "Toom–Cook" are sometimes incorrectly used interchangeably, Toom-3 is only a single instance of the Toom–Cook algorithm, where k = 3.

Toom-3 reduces 9 multiplications to 5, and runs in Θ(n^{log(5)/log(3)}) ≈ Θ(n^1.46). In general, Toom-k runs in Θ(c(k) n^e), where e = log(2k − 1) / log(k), n^e is the time spent on sub-multiplications, and c is the time spent on additions and multiplication by small constants. The Karatsuba algorithm is a special case of Toom–Cook, where the number is split into two smaller ones. It reduces 4 multiplications to 3 and so operates at Θ(n^{log(3)/log(2)}) ≈ Θ(n^1.58). Ordinary long multiplication is equivalent to Toom-1, with complexity Θ(n²).

Although the exponent e can be set arbitrarily close to 1 by increasing k, the function c unfortunately grows very rapidly. The growth rate for mixed-level Toom–Cook schemes was still an open research problem in 2005. An implementation described by Donald Knuth achieves the time complexity Θ(n 2^{√2 log n} log n).

Due to its overhead, Toom–Cook is slower than long multiplication with small numbers, and it is therefore typically used for intermediate-size multiplications, before the asymptotically faster Schönhage–Strassen algorithm (with complexity Θ(n log n log log n)) becomes practical.

Toom first described this algorithm in 1963, and Cook published an improved (asymptotically equivalent) algorithm in his PhD thesis in 1966.

In mathematics, the Gibbs phenomenon, discovered by Henry Wilbraham (1848) and rediscovered by J. Willard Gibbs (1899), is the peculiar manner in which the Fourier series of a piecewise continuously differentiable periodic function behaves at a jump discontinuity. The nth partial sum of the Fourier series has large oscillations near the jump, which might increase the maximum of the partial sum above that of the function itself. The overshoot does not die out as n increases, but approaches a finite limit. This sort of behavior was also observed by experimental physicists, but was believed to be due to imperfections in the measuring apparatus.

This is one cause of ringing artifacts in signal processing.