Search Results for ""

A ring without zero divisors in which an integer norm and an associated division algorithm (i.e., a Euclidean algorithm) can be defined. For signed integers, the usual norm ...

An array of "trees" of unit height located at integer-coordinate points in a point lattice. When viewed from a corner along the line y=x in normal perspective, a quadrant of ...

Experimental mathematics is a type of mathematical investigation in which computation is used to investigate mathematical structures and identify their fundamental properties ...

A distribution which arises in the study of half-integer spin particles in physics, P(k)=(k^s)/(e^(k-mu)+1). (1) Its integral is given by int_0^infty(k^sdk)/(e^(k-mu)+1) = ...

A congruence of the form f(x)=g(x) (mod n), where f(x) and g(x) are both integer polynomials. Functional congruences are sometimes also called "identical congruences" (Nagell ...

Any collineation from P(V) to P(V), where V is a three-dimensional vector space, is associated with a semilinear map from V to V.

If x_1<x_2<...<x_n denote the zeros of p_n(x), there exist real numbers lambda_1,lambda_2,...,lambda_n such that ...

_2F_1(-1/2,-1/2;1;h^2) = sum_(n=0)^(infty)(1/2; n)^2h^(2n) (1) = 1+1/4h^2+1/(64)h^4+1/(256)h^6+... (2) (OEIS A056981 and A056982), where _2F_1(a,b;c;x) is a hypergeometric ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...