Search Results for ""

Every even number is the difference of two consecutive primes in infinitely many ways (Dickson 2005, p. 424). If true, taking the difference 2, this conjecture implies that ...

de Rham cohomology is a formal set-up for the analytic problem: If you have a differential k-form omega on a manifold M, is it the exterior derivative of another differential ...

The first de Villiers point is the perspector of the reference triangle and its BCI triangle, which is Kimberling center X_(1127) and has triangle center function ...

A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...

An amazing pandigital approximation to e that is correct to 18457734525360901453873570 decimal digits is given by (1+9^(-4^(7·6)))^(3^(2^(85))), (1) found by R. Sabey in 2004 ...

The h-statistic h_r is the unique symmetric unbiased estimator for a central moment of a distribution <h_r>=mu_r. (1) In addition, the variance var(h_r)=<(h_r-mu_r)^2> (2) is ...

An invariant of an elliptic curve given in the form y^2=x^3+ax+b which is closely related to the elliptic discriminant and defined by j(E)=(2^83^3a^3)/(4a^3+27b^2). The ...

A k-coloring of a graph G is a vertex coloring that is an assignment of one of k possible colors to each vertex of G (i.e., a vertex coloring) such that no two adjacent ...

Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...

A k-subset is a subset of a set on n elements containing exactly k elements. The number of k-subsets on n elements is therefore given by the binomial coefficient (n; k). For ...