Search Results for ""

A Gaussian sum is a sum of the form S(p,q)=sum_(r=0)^(q-1)e^(-piir^2p/q), (1) where p and q are relatively prime integers. The symbol phi is sometimes used instead of S. ...

The constant e^pi that Gelfond's theorem established to be transcendental seems to lack a generally accepted name. As a result, in this work, it will be dubbed Gelfond's ...

Gelfond's theorem, also called the Gelfond-Schneider theorem, states that a^b is transcendental if 1. a is algebraic !=0,1 and 2. b is algebraic and irrational. This provides ...

Let O be an incidence geometry, i.e., a set with a symmetric, reflexive binary relation I. Let e and f be elements of O. Let an incidence plane be an incidence geometry whose ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...

The Gibert point can be defined as follows. Given a reference triangle DeltaABC, reflect the point X_(1157) (which is the inverse point of the Kosnita point in the ...

Let the difference of successive primes be defined by d_n=p_(n+1)-p_n, and d_n^k by d_n^k={d_n for k=1; |d_(n+1)^(k-1)-d_n^(k-1)| for k>1. (1) N. L. Gilbreath claimed that ...

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...

Any composite number n with p|(n/p-1) for all prime divisors p of n. n is a Giuga number iff sum_(k=1)^(n-1)k^(phi(n))=-1 (mod n) (1) where phi is the totient function and ...

If n>1 and n|1^(n-1)+2^(n-1)+...+(n-1)^(n-1)+1, is n necessarily a prime? In other words, defining s_n=sum_(k=1)^(n-1)k^(n-1), does there exist a composite n such that s_n=-1 ...