To stay up to date you can also follow on Mastodon.

🔗 Computing 🔗 Computing/Software

In computer programming jargon, a heisenbug is a software bug that seems to disappear or alter its behavior when one attempts to study it. The term is a pun on the name of Werner Heisenberg, the physicist who first asserted the observer effect of quantum mechanics, which states that the act of observing a system inevitably alters its state. In electronics the traditional term is probe effect, where attaching a test probe to a device changes its behavior.

Similar terms, such as bohrbug, mandelbug, hindenbug, and schrödinbug (see the section on related terms) have been occasionally proposed for other kinds of unusual software bugs, sometimes in jest; however, unlike the term heisenbug, they are not widely known or used.

🔗 Mathematics

A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 6 is composite because it is the product of two numbers (2 × 3) that are both smaller than 6. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

The property of being prime is called primality. A simple but slow method of checking the primality of a given number ${\displaystyle n}$, called trial division, tests whether ${\displaystyle n}$ is a multiple of any integer between 2 and ${\displaystyle {\sqrt {n}}}$. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always produces the correct answer in polynomial time but is too slow to be practical. Particularly fast methods are available for numbers of special forms, such as Mersenne numbers. As of December 2018 the largest known prime number has 24,862,048 decimal digits.

There are infinitely many primes, as demonstrated by Euclid around 300 BC. No known simple formula separates prime numbers from composite numbers. However, the distribution of primes within the natural numbers in the large can be statistically modelled. The first result in that direction is the prime number theorem, proven at the end of the 19th century, which says that the probability of a randomly chosen number being prime is inversely proportional to its number of digits, that is, to its logarithm.

Several historical questions regarding prime numbers are still unsolved. These include Goldbach's conjecture, that every even integer greater than 2 can be expressed as the sum of two primes, and the twin prime conjecture, that there are infinitely many pairs of primes having just one even number between them. Such questions spurred the development of various branches of number theory, focusing on analytic or algebraic aspects of numbers. Primes are used in several routines in information technology, such as public-key cryptography, which relies on the difficulty of factoring large numbers into their prime factors. In abstract algebra, objects that behave in a generalized way like prime numbers include prime elements and prime ideals.

🔗 Mathematics

In geometry, Prince Rupert's cube (named after Prince Rupert of the Rhine) is the largest cube that can pass through a hole cut through a unit cube, i.e. through a cube whose sides have length 1, without splitting the cube into two pieces. Its side length is approximately 6% larger than that of the unit cube through which it passes. The problem of finding the largest square that lies entirely within a unit cube is closely related, and has the same solution.

The original proposition posed by Prince Rupert of the Rhine was that a cube could be passed through a hole made in another cube of the same size without splitting the cube into two pieces.

🔗 United States 🔗 Spaceflight 🔗 Automobiles

Elon Musk's Tesla Roadster is an electric sports car that served as the dummy payload for the February 2018 Falcon Heavy test flight and became an artificial satellite of the Sun. "Starman", a mannequin dressed in a spacesuit, occupies the driver's seat. The car and rocket are products of Tesla and SpaceX, respectively, both companies founded by Elon Musk. The 2008-model Roadster was previously used by Musk for commuting to work and is the only production car in space.

The car, mounted on the rocket's second stage, acquired enough velocity to escape Earth's gravity and enter an elliptical heliocentric orbit crossing the orbit of Mars. The orbit reaches a maximum distance from the Sun at aphelion of 1.66 astronomical units (au). During the early portion of the voyage outside the Earth's atmosphere, live video was transmitted back to the mission control center and live-streamed for slightly over four hours.

Advertising analysts noted Musk's sense of brand management and use of new media for his decision to launch a Tesla into space. While some commenters voiced concern that the car contributed to space debris, others saw it as a work of art. Musk explained he wanted to inspire the public about the "possibility of something new happening in space" as part of his larger vision for spreading humanity to other planets.

🔗 Cryptography 🔗 Cryptography/Computer science

In cryptography a blind signature, as introduced by David Chaum, is a form of digital signature in which the content of a message is disguised (blinded) before it is signed. The resulting blind signature can be publicly verified against the original, unblinded message in the manner of a regular digital signature. Blind signatures are typically employed in privacy-related protocols where the signer and message author are different parties. Examples include cryptographic election systems and digital cash schemes.

An often-used analogy to the cryptographic blind signature is the physical act of a voter enclosing a completed anonymous ballot in a special carbon paper lined envelope that has the voter's credentials pre-printed on the outside. An official verifies the credentials and signs the envelope, thereby transferring their signature to the ballot inside via the carbon paper. Once signed, the package is given back to the voter, who transfers the now signed ballot to a new unmarked normal envelope. Thus, the signer does not view the message content, but a third party can later verify the signature and know that the signature is valid within the limitations of the underlying signature scheme.

Blind signatures can also be used to provide unlinkability, which prevents the signer from linking the blinded message it signs to a later un-blinded version that it may be called upon to verify. In this case, the signer's response is first "un-blinded" prior to verification in such a way that the signature remains valid for the un-blinded message. This can be useful in schemes where anonymity is required.

Blind signature schemes can be implemented using a number of common public key signing schemes, for instance RSA and DSA. To perform such a signature, the message is first "blinded", typically by combining it in some way with a random "blinding factor". The blinded message is passed to a signer, who then signs it using a standard signing algorithm. The resulting message, along with the blinding factor, can be later verified against the signer's public key. In some blind signature schemes, such as RSA, it is even possible to remove the blinding factor from the signature before it is verified. In these schemes, the final output (message/signature) of the blind signature scheme is identical to that of the normal signing protocol.

🔗 Religion 🔗 Women's History 🔗 Japan 🔗 Japan/Religion 🔗 Religion/New religious movements 🔗 Japan/Shinto

Oomoto (大本, Ōmoto, Great Source, or Great Origin), also known as Oomoto-kyo (大本教, Ōmoto-kyō), is a religion founded in 1892 by Deguchi Nao (1836–1918), often categorised as a new Japanese religion originated from Shinto. The spiritual leaders of the movement have predominantly been women; however, Deguchi Onisaburō (1871–1948) has been considered an important figure in Omoto as a seishi (spiritual teacher). Since 2001, the movement has been guided by its fifth leader, Kurenai Deguchi.

🔗 Medicine 🔗 Dance

Dancing mania (also known as dancing plague, choreomania, St. John's Dance and St. Vitus's Dance) was a social phenomenon that occurred primarily in mainland Europe between the 14th and 17th centuries. It involved groups of people dancing erratically, sometimes thousands at a time. The mania affected men, women, and children who danced until they collapsed from exhaustion. One of the first major outbreaks was in Aachen, in the Holy Roman Empire, in 1374, and it quickly spread throughout Europe; one particularly notable outbreak occurred in Strasbourg in 1518, also in the Holy Roman Empire.

Affecting thousands of people across several centuries, dancing mania was not an isolated event, and was well documented in contemporary reports. It was nevertheless poorly understood, and remedies were based on guesswork. Often musicians accompanied dancers, due to a belief that music would treat the mania, but this tactic sometimes backfired by encouraging more to join in. There is no consensus among modern-day scholars as to the cause of dancing mania.

The several theories proposed range from religious cults being behind the processions to people dancing to relieve themselves of stress and put the poverty of the period out of their minds. It is speculated to have been a mass psychogenic illness, in which physical symptoms with no known physical cause are observed to affect a group of people, as a form of social influence.

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

🔗 Companies 🔗 Lists

This list of the oldest companies in the world includes brands and companies, excluding associations and educational, government, or religious organizations. To be listed, a brand or company name must remain operating, either in whole or in part, since inception. Note however that such claims are often open to question and should be researched further before citing them.

🔗 Languages 🔗 Constructed languages

Solresol (Solfège: Sol-Re-Sol) is a constructed language devised by François Sudre, beginning in 1827. His major book on it, Langue Musicale Universelle, was published after his death in 1866, though he had already been publicizing it for some years. Solresol enjoyed a brief spell of popularity, reaching its pinnacle with Boleslas Gajewski's 1902 publication of Grammaire du Solresol. An ISO 639-3 language code had been requested on 28 July 2017, but was rejected on 1 February 2018.

Today, there exist small communities of Solresol enthusiasts scattered across the world, able to communicate with one another thanks to the Internet.