Lucky numbers

In number theory, a lucky number is a natural number in a set which is generated by a "sieve" similar to the Sieve of Eratosthenes that generates the primes.
Begin with a list of integers starting with 1:

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,

Every second number (all even numbers) is eliminated, leaving only the odd integers:

1,    3,    5,    7,    9,   11,   13,   15,   17,   19,   21,   23,   25,

The second term in this sequence is 3. Every third number which remains in the list is eliminated:

1,    3,          7,    9,         13,   15,         19,   21,         25,

The next surviving number is now 7, so every seventh number that remains is eliminated:

1,    3,          7,    9,         13,   15,               21,         25,

When this procedure has been carried out completely, the survivors are the lucky numbers:

1, 3, 7, 9, 13, 15, 21, 25, 31, 33, 37, 43, 49, 51, 63, 67, 69, 73, 75, 79, 87, 93, 99, ... (sequence A000959 in OEIS).

The term was introduced in 1956 in a paper by Gardiner, Lazarus, Metropolis and Ulam. They suggest also calling its defining sieve, "the sieve of Josephus Flavius" because of its similarity with the counting-out game in the Josephus problem.
Lucky numbers share some properties with primes, such as asymptotic behaviour according to the prime number theorem; also, a version of Goldbach's conjecture has been extended to them. There are infinitely many lucky numbers. However, if Ln denotes the n-th lucky number, and pn the n-th prime, then Ln > pn for all sufficiently large n.
Because of these apparent connections with the prime numbers, some mathematicians have suggested that these properties may be found in a larger class of sets of numbers generated by sieves of a certain unknown form, although there is little theoretical basis for this conjecture. Twin lucky numbers and twin primes also appear to occur with similar frequency.
A lucky prime is a lucky number that is prime. It is not known whether there are infinitely many lucky primes. The first few are

3, 7, 13, 31, 37, 43, 67, 73, 79, 127, 151, 163, 193 (sequence A031157 in OEIS).

An animation demonstrating the lucky number sieve. The numbers in red are lucky numbers.

From wikipedia.

Trefoil Knot

In topology, a branch of mathematics, the trefoil knot is the simplest example of a nontrivial knot. The trefoil can be obtained by joining together the two loose ends of a common overhand knot, resulting in a knotted loop. As the simplest knot, the trefoil is fundamental to the study of mathematical knot theory, which has diverse applications in topology, geometry, physics, and chemistry.

The trefoil knot is named after the three-leaf clover (or trefoil) plant.

 

From Wikipedia.

Gauss theorem

Given three integers a, b ​​and c, we have:
(a ∧ b = 1 and a | bc) ⇒ a | c. 

Demonstration :
Suppose a ∧ b = 1 and a | bc. According to the Bezout identity, there are two integers u and v such that au + bv = 1, which implies acu+bcv= c.
as a | bc, a | bcv and therefore:
a | acu + bcv=c.

Lagrange polynomial

In numerical analysis, Lagrange polynomials are used for polynomial interpolation. For a given set of distinct points and numbers , the Lagrange polynomial is the polynomial of the least degree that at each point assumes the corresponding value (i.e. the functions coincide at each point). The interpolating polynomial of the least degree is unique, however, and it is therefore more appropriate to speak of "the Lagrange form" of that unique polynomial rather than "the Lagrange interpolation polynomial," since the same polynomial can be arrived at through multiple methods. Although named after Joseph Louis Lagrange, who published it in 1795, it was first discovered in 1779 by Edward Waring and it is also an easy consequence of a formula published in 1783 by Leonhard Euler.
Lagrange interpolation is susceptible to Runge's phenomenon, and the fact that changing the interpolation points requires recalculating the entire interpolant can make Newton polynomials easier to use. Lagrange polynomials are used in the Newton–Cotes method of numerical integration and in Shamir's secret sharing scheme in cryptography.
Example:

This image shows, for four points ((−9, 5), (−4, 2), (−1, −2), (7, 9)), the (cubic) interpolation polynomial L(x), which is the sum of the scaled basis polynomials y0ℓ0(x), y1ℓ1(x), y2ℓ2(x) and y3ℓ3(x). The interpolation polynomial passes through all four control points, and each scaled basis polynomial passes through its respective control point and is 0 where x corresponds to the other three control points.

From Wikipedia. 

A representation of Riemann zeta funcion

Riemann zeta function ζ(s) in the complex plane. The color of a point s encodes the value of ζ(s): colors close to black denote values close to zero, while hue encodes the value's argument. The white spot at s = 1 is the pole of the zeta function; the black spots on the negative real axis and on the critical line Re(s) = 1/2 are its zeros. Values with arguments close to zero including positive reals on the real half-line are presented in red.

 This is the color function used in the picture above.

From Wikipedia.

Riemann zeta function

The Riemann zeta function or Euler–Riemann zeta function, ζ(s), is a function of a complex variable s that analytically continues the sum of the infinite series which converges when the real part of s is greater than 1. More general representations of ζ(s) for all s are given below. The Riemann zeta function plays a pivotal role in analytic number theory and has applications in physics, probability theory, and applied statistics.

This function, as a function of a real argument, was introduced and studied by Leonhard Euler in the first half of the eighteenth century without using complex analysis, which was not available at that time. Bernhard Riemann in his memoir "On the Number of Primes Less Than a Given Magnitude" published in 1859 extended the Euler definition to a complex variable, proved its meromorphic continuation and functional equation and established a relation between its zeros and the distribution of prime numbers.[1]

The values of the Riemann zeta function at even positive integers were computed by Euler. The first of them, ζ(2), provides a solution to the Basel problem. In 1979 Apéry proved the irrationality of ζ(3). The values at negative integer points, also found by Euler, are rational numbers and play an important role in the theory of modular forms. Many generalizations of the Riemann zeta function, such as Dirichlet series, Dirichlet L-functions and L-functions, are known.

From Wikipedia.

Bessel functions

In mathematics, Bessel functions, first defined by the mathematician Daniel Bernoulli and generalized by Friedrich Bessel, are canonical solutions y(x) of Bessel's differential equation:

for an arbitrary real or complex number α (the order of the Bessel function); the most common and important cases are for α an integer or half-integer.

Although α and −α produce the same differential equation, it is conventional to define different Bessel functions for these two orders, so that the Bessel functions are mostly smooth functions of α. Bessel functions are also known as cylinder functions or cylindrical harmonics because they are found in the solution to Laplace's equation in cylindrical coordinates.

From Wikipedia.