Search Results for ""

The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...

An equation of the form f(x,y,...)=0, where f contains a finite number of independent variables, known functions, and unknown functions which are to be solved for. Many ...

An irrational number x can be called GK-regular (defined here for the first time) if the distribution of its continued fraction coefficients is the Gauss-Kuzmin distribution. ...

The modular group Gamma is the set of all transformations w of the form w(t)=(at+b)/(ct+d), where a, b, c, and d are integers and ad-bc=1. A Gamma-modular function is then ...

A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...

A figurate number of the form g_n=2n-1 giving the area of the square gnomon obtained by removing a square of side n-1 from a square of side n, g_n = n^2-(n-1)^2 (1) = 2n-1. ...

A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

An edge subdivision is the insertion of a new vertex v_j in the middle of an exiting edge e=v_iv_k accompanied by the joining of the original edge endpoints with the new ...

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...