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

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

🔗 Russia 🔗 Mathematics 🔗 Statistics 🔗 Russia/science and education in Russia

In statistics, the Gauss–Markov theorem states that the ordinary least squares (OLS) estimator has the lowest sampling variance within the class of linear unbiased estimators, if the errors in the linear regression model are uncorrelated, have equal variances and expectation value of zero. The errors do not need to be normal, nor do they need to be independent and identically distributed (only uncorrelated with mean zero and homoscedastic with finite variance). The requirement that the estimator be unbiased cannot be dropped, since biased estimators exist with lower variance. See, for example, the James–Stein estimator (which also drops linearity) or ridge regression.

The theorem was named after Carl Friedrich Gauss and Andrey Markov, although Gauss' work significantly predates Markov's. But while Gauss derived the result under the assumption of independence and normality, Markov reduced the assumptions to the form stated above. A further generalization to non-spherical errors was given by Alexander Aitken.

🔗 Mathematics

Bellard's formula is used to calculate the nth digit of π in base 16.

Bellard's formula was discovered by Fabrice Bellard in 1997. It is about 43% faster than the Bailey–Borwein–Plouffe formula (discovered in 1995). It has been used in PiHex, the now-completed distributed computing project.

One important application is verifying computations of all digits of pi performed by other means. Rather than having to compute all of the digits twice by two separate algorithms to ensure that a computation is correct, the final digits of a very long all-digits computation can be verified by the much faster Bellard's formula.

Formula:

${\displaystyle {\begin{aligned}\pi ={\frac {1}{2^{6}}}\sum _{n=0}^{\infty }{\frac {(-1)^{n}}{2^{10n}}}\,\left(-{\frac {2^{5}}{4n+1}}\right.&{}-{\frac {1}{4n+3}}+{\frac {2^{8}}{10n+1}}-{\frac {2^{6}}{10n+3}}\left.{}-{\frac {2^{2}}{10n+5}}-{\frac {2^{2}}{10n+7}}+{\frac {1}{10n+9}}\right)\end{aligned}}}$

🔗 Biography 🔗 Mathematics 🔗 Biography/science and academia 🔗 Astronomy 🔗 Linguistics 🔗 Linguistics/Applied Linguistics 🔗 Indigenous peoples of North America 🔗 University of Oxford

Thomas Harriot (Oxford, c. 1560 – London, 2 July 1621), also spelled Harriott, Hariot or Heriot, was an English astronomer, mathematician, ethnographer and translator who made advances within the scientific field. Thomas Harriot was recognized for his contributions in astronomy, mathematics, and navigational techniques. Harriot worked closely with John White to create advanced maps for navigation. While Harriot worked extensively on numerous papers on the subjects of astronomy, mathematics, and navigation the amount of work that was actually published was sparse. So sparse that the only publication that has been produced by Harriot was The Briefe and True Report of the New Found Land of Virginia. The premise of the book includes descriptions of English settlements and financial issues in Virginia at the time. He is sometimes credited with the introduction of the potato to the British Isles. Harriot was the first person to make a drawing of the Moon through a telescope, on 26 July 1609, over four months before Galileo Galilei.

After graduating from St Mary Hall, Oxford, Harriot travelled to the Americas, accompanying the 1585 expedition to Roanoke island funded by Sir Walter Raleigh and led by Sir Ralph Lane. Harriot was a vital member of the venture, having learned and translating the Carolina Algonquian language from two Native Americans: Wanchese and Manteo. On his return to England, he worked for the 9th Earl of Northumberland. At the Earl's house, he became a prolific mathematician and astronomer to whom the theory of refraction is attributed.

🔗 Biography 🔗 Mathematics 🔗 Religion 🔗 Physics 🔗 London 🔗 Philosophy 🔗 England 🔗 Biography/science and academia 🔗 Astronomy 🔗 Philosophy/Philosophy of science 🔗 History of Science 🔗 Philosophy/Philosophers 🔗 Biography/politics and government 🔗 Philosophy/Metaphysics 🔗 Physics/Biographies 🔗 Christianity 🔗 Christianity/theology 🔗 Lincolnshire 🔗 Anglicanism

Isaac Newton (4 January 1643 – 31 March 1727) was considered an insightful and erudite theologian by his Protestant contemporaries. He wrote many works that would now be classified as occult studies, and he wrote religious tracts that dealt with the literal interpretation of the Bible. He kept his heretical beliefs private.

Newton's conception of the physical world provided a model of the natural world that would reinforce stability and harmony in the civic world. Newton saw a monotheistic God as the masterful creator whose existence could not be denied in the face of the grandeur of all creation. Although born into an Anglican family, and a devout but unorthodox Christian, by his thirties Newton held a Christian faith that, had it been made public, would not have been considered orthodox by mainstream Christians. Scholars now consider him a Nontrinitarian Arian.

He may have been influenced by Socinian christology.

🔗 Mathematics

In combinatorial mathematics, a superpermutation on n symbols is a string that contains each permutation of n symbols as a substring. While trivial superpermutations can simply be made up of every permutation concatenated together, superpermutations can also be shorter (except for the trivial case of n = 1) because overlap is allowed. For instance, in the case of n = 2, the superpermutation 1221 contains all possible permutations (12 and 21), but the shorter string 121 also contains both permutations.

It has been shown that for 1 ≤ n ≤ 5, the smallest superpermutation on n symbols has length 1! + 2! + … + n! (sequence A180632 in the OEIS). The first four smallest superpermutations have respective lengths 1, 3, 9, and 33, forming the strings 1, 121, 123121321, and 123412314231243121342132413214321. However, for n = 5, there are several smallest superpermutations having the length 153. One such superpermutation is shown below, while another of the same length can be obtained by switching all of the fours and fives in the second half of the string (after the bold 2):

12345123­41523412­53412354­12314523­14253142­35142315­42312453­12435124­31524312­54312134­52134251­34215342­13542132­45132415­32413524­13254132­14532143­52143251­432154321

For the cases of n > 5, a smallest superpermutation has not yet been proved nor a pattern to find them, but lower and upper bounds for them have been found.

🔗 Mathematics 🔗 Physics 🔗 Lists 🔗 Anthroponymy

Carl Friedrich Gauss (1777–1855) is the eponym of all of the topics listed below. There are over 100 topics all named after this German mathematician and scientist, all in the fields of mathematics, physics, and astronomy. The English eponymous adjective Gaussian is pronounced GOWSS-ee-ən.

🔗 Mathematics 🔗 Books 🔗 Systems

How to Solve It (1945) is a small volume by mathematician George Pólya describing methods of problem solving.

🔗 Computing 🔗 Mathematics 🔗 Statistics 🔗 Robotics

In graph theory, a moral graph is used to find the equivalent undirected form of a directed acyclic graph. It is a key step of the junction tree algorithm, used in belief propagation on graphical models.

The moralized counterpart of a directed acyclic graph is formed by adding edges between all pairs of non-adjacent nodes that have a common child, and then making all edges in the graph undirected. Equivalently, a moral graph of a directed acyclic graph G is an undirected graph in which each node of the original G is now connected to its Markov blanket. The name stems from the fact that, in a moral graph, two nodes that have a common child are required to be married by sharing an edge.

Moralization may also be applied to mixed graphs, called in this context "chain graphs". In a chain graph, a connected component of the undirected subgraph is called a chain. Moralization adds an undirected edge between any two vertices that both have outgoing edges to the same chain, and then forgets the orientation of the directed edges of the graph.

🔗 Mathematics

Wikipedia provides one of the more prominent resources on the Web for factual information about contemporary mathematics, with over 20,000 articles on mathematical topics. It is natural that many readers use Wikipedia for the purpose of self-study in mathematics and its applications. Some readers will be simultaneously studying mathematics in a more formal way, while others will rely on Wikipedia alone. There are certain points that need to be kept in mind by anyone using Wikipedia for mathematical self-study, in order to make the best use of what is here, perhaps in conjunction with other resources.

🔗 Mathematics

The 15-puzzle (also called Gem Puzzle, Boss Puzzle, Game of Fifteen, Mystic Square and many others) is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The puzzle also exists in other sizes, particularly the smaller 8-puzzle. If the size is 3×3 tiles, the puzzle is called the 8-puzzle or 9-puzzle, and if 4×4 tiles, the puzzle is called the 15-puzzle or 16-puzzle named, respectively, for the number of tiles and the number of spaces. The object of the puzzle is to place the tiles in order by making sliding moves that use the empty space.

The n-puzzle is a classical problem for modelling algorithms involving heuristics. Commonly used heuristics for this problem include counting the number of misplaced tiles and finding the sum of the taxicab distances between each block and its position in the goal configuration. Note that both are admissible, i.e. they never overestimate the number of moves left, which ensures optimality for certain search algorithms such as A*.