Search Results for ""

A finite simple group of Lie-type. The following table summarizes the types of twisted Chevalley groups and their respective orders. In the table, q denotes a prime power and ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

Elliptic curve primality proving, abbreviated ECPP, is class of algorithms that provide certificates of primality using sophisticated results from the theory of elliptic ...

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...

The golden ratio has decimal expansion phi=1.618033988749894848... (OEIS A001622). It can be computed to 10^(10) digits of precision in 24 CPU-minutes on modern hardware and ...

An NSW number (named after Newman, Shanks, and Williams) is an integer m that solves the Diophantine equation 2n^2=m^2+1. (1) In other words, the NSW numbers m index the ...

Consider the consecutive number sequences formed by the concatenation of the first n positive integers: 1, 12, 123, 1234, ... (OEIS A007908; Smarandache 1993, Dumitrescu and ...

The constant e with decimal expansion e=2.718281828459045235360287471352662497757... (OEIS A001113) can be computed to 10^9 digits of precision in 10 CPU-minutes on modern ...

An abnormal number is a hypothetical number which can be factored into primes in more than one way. Hardy and Wright (1979) prove the fundamental theorem of arithmetic by ...

Given a property P, if P(x)∼x as x->infty (so, using asymptotic notation, the number of numbers less than x not satisfying the property P is o(x), where o(x) is one of the ...