Search Results for ""

A Euclidean motion of R^n is an affine transformation whose linear part is an orthogonal transformation.

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

For any two integers a and b, suppose d|ab. Then if d is relatively prime to a, then d divides b. This results appeared in Euclid's Elements, Book VII, Proposition 30. This ...

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

Euler integration was defined by Schanuel and subsequently explored by Rota, Chen, and Klain. The Euler integral of a function f:R->R (assumed to be piecewise-constant with ...

A special case of the Artin L-function for the polynomial x^2+1. It is given by L(s)=product_(p odd prime)1/(1-chi^-(p)p^(-s)), (1) where chi^-(p) = {1 for p=1 (mod 4); -1 ...

Define the Euler measure of a polyhedral set as the Euler integral of its indicator function. It is easy to show by induction that the Euler measure of a closed bounded ...

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

Define g(k) as the quantity appearing in Waring's problem, then Euler conjectured that g(k)=2^k+|_(3/2)^k_|-2, where |_x_| is the floor function.

Due to Euler's prolific output, there are a great number of theorems that are know by the name "Euler's theorem." A sampling of these are Euler's displacement theorem for ...