Search Results for ""

A quasi-regular graph is a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 (Bozóki et al. 2020). ...

A primality test that provides an efficient probabilistic algorithm for determining if a given number is prime. It is based on the properties of strong pseudoprimes. The ...

Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...

Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Let n be an odd composite number with (n,D)=1, and n-(D/n)=2^sd with d odd and s>=0, ...

An untouchable number is a positive integer that is not the sum of the proper divisors of any number. The first few are 2, 5, 52, 88, 96, 120, 124, 146, ... (OEIS A005114). ...

A pair of dice which have the same odds for throwing every number as a normal pair of 6-sided dice. They are the only such alternate arrangement if face values are required ...

A power of 10.

A polynomial with real positive coefficients and roots which are either negative or pairwise conjugate with negative real parts.

An Artin L-function over the rationals Q encodes in a generating function information about how an irreducible monic polynomial over Z factors when reduced modulo each prime. ...

Let p be an odd prime and F_n the cyclotomic field of p^(n+1)th roots of unity over the rational field. Now let p^(e(n)) be the power of p which divides the class number h_n ...