Search Results for ""

A Belphegor prime (also known as a Beelphegor prime) is a prime Belphegor number, i.e., a palindromic prime of the form 1(0...)666(0...)1. The first few Belphegor primes are ...

A class of curve defined at integer values which hops from one value to another. Their name derives from the Greek word betaalphataurhoalphachiiotaomicronnu batrachion, which ...

Informally, an L^2-function is a function f:X->R that is square integrable, i.e., |f|^2=int_X|f|^2dmu with respect to the measure mu, exists (and is finite), in which case ...

The fibonorial n!_F, also called the Fibonacci factorial, is defined as n!_F=product_(k=1)^nF_k, where F_k is a Fibonacci number. For n=1, 2, ..., the first few fibonorials ...

Let x be a positive number, and define lambda(d) = mu(d)[ln(x/d)]^2 (1) f(n) = sum_(d)lambda(d), (2) where the sum extends over the divisors d of n, and mu(n) is the Möbius ...

Let F_n be the nth Fibonacci number, and let (p|5) be a Legendre symbol so that e_p=(p/5)={1 for p=1,4 (mod 5); -1 for p=2,3 (mod 5). (1) A prime p is called a Wall-Sun-Sun ...

The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...

A fraction containing each of the digits 1 through 9 is called a pandigital fraction. The following table gives the number of pandigital fractions which represent simple unit ...

The nth cubic number n^3 is a sum of n consecutive odd numbers, for example 1^3 = 1 (1) 2^3 = 3+5 (2) 3^3 = 7+9+11 (3) 4^3 = 13+15+17+19, (4) etc. This identity follows from ...

Let f(z) be a transcendental meromorphic function, and let D_1, D_2, ..., D_5 be five simply connected domains in C with disjoint closures (Ahlfors 1932). Then there exists j ...