Search Results for ""

Every irrational number x can be expanded in a unique continued fraction expansion x=b_0+(e_1)/(b_1+(e_2)/(b_2+(e_3)/(b_3+...)))=[b_0;e_1b_1,e_2b_2,e_3b_3,...] such that b_0 ...

The Connell sequence is the sequence obtained by starting with the first positive odd number (1), taking the next two even numbers (2, 4), the next three odd numbers (5, 7, ...

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...

The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...

The triangle with edge lengths 3, 4, and 5 is the right triangle with smallest possible integer lengths and corresponds to the Pythagorean triple (3,4,5) where the legs have ...

The ABC (atom-bond connectivity) matrix A_(ABC) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt((d_i+d_j-2)/(d_id_j)), (1) where d_i are the ...

The ABC (atom-bond connectivity) spectral radius rho_(ABC) of a graph is defined as the largest eigenvalue of its ABC matrix. Chen (2019) showed that for a tree on 3 or more ...

There are at least two results known as "the area principle." The geometric area principle states that (|A_1P|)/(|A_2P|)=(|A_1BC|)/(|A_2BC|). (1) This can also be written in ...

The arithmetic-geometric energy of a graph is defined as the graph energy of its arithmetic-geometric matrix, i.e., the sum of the absolute values of the eigenvalues of its ...

The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...