Search Results for ""

The 2-1 equation A^n+B^n=C^n (1) is a special case of Fermat's last theorem and so has no solutions for n>=3. Lander et al. (1967) give a table showing the smallest n for ...

In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...

Einstein summation is a notational convention for simplifying expressions including summations of vectors, matrices, and general tensors. There are essentially three rules of ...

Consider an arbitrary one-dimensional map x_(n+1)=F(x_n) (1) (with implicit parameter r) at the onset of chaos. After a suitable rescaling, the Feigenbaum function ...

The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

In 1757, V. Riccati first recorded the generalizations of the hyperbolic functions defined by F_(n,r)^alpha(x)=sum_(k=0)^infty(alpha^k)/((nk+r)!)x^(nk+r), (1) for r=0, ..., ...

The Gömböc (meaning "sphere-like" in Hungarian) is the name given to a class of convex solids which possess a unique stable and a unique unstable point of equilibrium. ...

A grammar defining formal language L is a quadruple (N,T,R,S), where N is a finite set of nonterminals, T is a finite set of terminal symbols, R is a finite set of ...

Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...