A Markov number is a specific type of positive integer that is associated with a particular solution to Markov's equation, which is given by: \[ x^2 + y^2 + z^2 = 3xyz \] where \( x \), \( y \), and \( z \) are positive integers. A set of numbers \( (x, y, z) \) that satisfies this equation is called a Markov triple.

As per stackoverflow.com/a/52351480/895245 our standard test setup is:

Let's see how long they last:

TODO evaluate. No pip install???

A Mordell curve is a type of algebraic curve defined by a specific type of equation. More formally, it can be described as an elliptic curve given by a Weierstrass equation of the form: \[ y^2 = x^3 + k \] where \( k \) is a constant. These curves are named after the mathematician Louise Mordell, who studied the properties of such equations and their rational points.

The term "Optic equation" does not refer to a specific, universally recognized equation in optics. Instead, it may refer to several key equations and principles used in the field of optics, which is the study of light and its behavior. 1. **Lens Maker's Equation**: This equation relates the focal length of a lens to the radii of curvature of its two surfaces and the refractive index of the lens material.

Exist because double bonds don't rotate freely. Have different properties of course, unlike enantiomer.

Bibliography:

The City of London is an obscene thing. Its existence goes against the will of the greater part of society. All it takes is one glance to see how it is but a bunch of corruption. See e.g.: The Spiders' Web: Britain's Second Empire.

Pell's equation is a specific type of Diophantine equation, which is an equation that seeks integer solutions. It is typically expressed in the form: \[ x^2 - Dy^2 = 1 \] Here, \( x \) and \( y \) are integers, and \( D \) is a positive integer that is not a perfect square. The main objective is to find integer pairs \((x, y)\) that satisfy this equation.

In the context of quantum computing of the 2020's, a "classical computer" is a computer that is not "quantum", i.e., the then dominating CMOS computers.

Proof by infinite descent is a mathematical proof technique that is particularly effective in certain areas, such as number theory. It is based on the principle that a statement is true if assuming its negation leads to an infinite sequence of cases that cannot exist in practice. The idea can be summarized as follows: 1. **Assumption of Negation**: Start by assuming that there exists a solution (or an example) that contradicts the statement you are trying to prove.

Political division:

The Banach-Mazur game is a two-player game in the field of set theory and topology, particularly in the context of functional analysis. It is named after mathematicians Stefan Banach and Juliusz Mazur, who introduced the game in the early 20th century. ### Rules of the Game: 1. **Players**: There are two players, typically called Player I and Player II.