TOPICS
Search

Search Results for ""


291 - 300 of 3828 for Aleph 0Search Results
The odd divisor function sigma_k^((o))(n)=sum_(d|n; d odd)d^k (1) is the sum of kth powers of the odd divisors of a number n. It is the analog of the divisor function for odd ...
Surreal numbers are the most natural collection of numbers which includes both the real numbers and the infinite ordinal numbers of Georg Cantor. They were invented by John ...
The Heaviside step function is a mathematical function denoted H(x), or sometimes theta(x) or u(x) (Abramowitz and Stegun 1972, p. 1020), and also known as the "unit step ...
A set of planes sharing a point in common. For planes specified in Hessian normal form, a bundle of planes can therefore be specified as ...
For an ellipse given by the parametric equations x = acost (1) y = bsint, (2) the catacaustic is a complicated expression for generic radiant point (x_r,y_r). However, it ...
Consider a game where everyone in a classroom picks a number between 0 and 100. The person closest to half the average wins. Obviously, picking a number over 50 would be ...
A tetradic (or four-way) number is a number that remains unchanged when flipped back to front, mirrored up-down, or flipped up-down. Since the only numbers that remain ...
Every planar graph (i.e., graph with graph genus 0) has an embedding on a torus. In contrast, toroidal graphs are embeddable on the torus, but not in the plane, i.e., they ...
An n-mark Golomb ruler is a set of n distinct nonnegative integers (a_1,a_2,...,a_n), called "marks," such that the positive differences |a_i-a_j|, computed over all possible ...
A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...
1 ... 27|28|29|30|31|32|33 ... 383 Previous Next

...