Search Results for ""

A singular point a for which f(z)(z-a)^n is not differentiable for any integer n>0.

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 ...

An Euler pseudoprime to the base b is a composite number n which satisfies b^((n-1)/2)=+/-1 (mod n). The first few base-2 Euler pseudoprimes are 341, 561, 1105, 1729, 1905, ...

The number of alternating permutations for n elements is sometimes called an Euler zigzag number. Denote the number of alternating permutations on n elements for which the ...

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) = ...

Define G(a,n)=1/aint_0^infty[1-e^(aEi(-t))sum_(k=0)^(n-1)((-a)^k[Ei(-t)]^k)/(k!)]. Then the Flajolet-Odlyzko constant is defined as G(1/2,1)=0.757823011268... (OEIS A143297).

For any real alpha and beta such that beta>alpha, let p(alpha)!=0 and p(beta)!=0 be real polynomials of degree n, and v(x) denote the number of sign changes in the sequence ...

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 ...