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

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

🔗 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*.

🔗 Mathematics 🔗 Physics

A topological quantum computer is a theoretical quantum computer that employs two-dimensional quasiparticles called anyons, whose world lines pass around one another to form braids in a three-dimensional spacetime (i.e., one temporal plus two spatial dimensions). These braids form the logic gates that make up the computer. The advantage of a quantum computer based on quantum braids over using trapped quantum particles is that the former is much more stable. Small, cumulative perturbations can cause quantum states to decohere and introduce errors in the computation, but such small perturbations do not change the braids' topological properties. This is like the effort required to cut a string and reattach the ends to form a different braid, as opposed to a ball (representing an ordinary quantum particle in four-dimensional spacetime) bumping into a wall. Alexei Kitaev proposed topological quantum computation in 1997. While the elements of a topological quantum computer originate in a purely mathematical realm, experiments in fractional quantum Hall systems indicate these elements may be created in the real world using semiconductors made of gallium arsenide at a temperature of near absolute zero and subjected to strong magnetic fields.

🔗 Biography 🔗 Mathematics 🔗 France 🔗 Women scientists 🔗 Biography/science and academia 🔗 Women's History 🔗 Mathematics/Mathematicians

Marie-Sophie Germain (French: [maʁi sɔfi ʒɛʁmɛ̃]; 1 April 1776 – 27 June 1831) was a French mathematician, physicist, and philosopher. Despite initial opposition from her parents and difficulties presented by society, she gained education from books in her father's library, including ones by Leonhard Euler, and from correspondence with famous mathematicians such as Lagrange, Legendre, and Gauss (under the pseudonym of «Monsieur LeBlanc»). One of the pioneers of elasticity theory, she won the grand prize from the Paris Academy of Sciences for her essay on the subject. Her work on Fermat's Last Theorem provided a foundation for mathematicians exploring the subject for hundreds of years after. Because of prejudice against her sex, she was unable to make a career out of mathematics, but she worked independently throughout her life. Before her death, Gauss had recommended that she be awarded an honorary degree, but that never occurred. On 27 June 1831, she died from breast cancer. At the centenary of her life, a street and a girls’ school were named after her. The Academy of Sciences established the Sophie Germain Prize in her honor.

🔗 Technology 🔗 Computing 🔗 Mathematics

A slide rule is a hand-operated mechanical calculator consisting of slidable rulers for evaluating mathematical operations such as multiplication, division, exponents, roots, logarithms, and trigonometry. It is one of the simplest analog computers.

Slide rules exist in a diverse range of styles and generally appear in a linear, circular or cylindrical form. Slide rules manufactured for specialized fields such as aviation or finance typically feature additional scales that aid in specialized calculations particular to those fields. The slide rule is closely related to nomograms used for application-specific computations. Though similar in name and appearance to a standard ruler, the slide rule is not meant to be used for measuring length or drawing straight lines. Nor is it designed for addition or subtraction, which is usually performed using other methods, like using an abacus. Maximum accuracy for standard linear slide rules is about three decimal significant digits, while scientific notation is used to keep track of the order of magnitude of results.

English mathematician and clergyman Reverend William Oughtred and others developed the slide rule in the 17th century based on the emerging work on logarithms by John Napier. It made calculations faster and less error-prone than evaluating on paper. Before the advent of the scientific pocket calculator, it was the most commonly used calculation tool in science and engineering. The slide rule's ease of use, ready availability, and low cost caused its use to continue to grow through the 1950s and 1960s, even as desktop electronic computers were gradually introduced. But after the handheld scientific calculator was introduced in 1972 and became inexpensive in the mid-1970s, slide rules became largely obsolete, so most suppliers departed the business.

In the United States, the slide rule is colloquially called a slipstick.