TOPICS
Search

Search Results for ""


371 - 380 of 819 for 2003Search Results
The Wallis formula follows from the infinite product representation of the sine sinx=xproduct_(n=1)^infty(1-(x^2)/(pi^2n^2)). (1) Taking x=pi/2 gives ...
A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...
Wyler's constant is defined as alpha_W = 9/(8pi^4)((pi^5)/(2^4·5!))^(1/4) (1) = 0.0072973... (2) = 1/(137.0360824...) (3) (Wyler 1969, 1971; OEIS A180872 and A180873), which ...
The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...
An aperiodic tiling is a non-periodic tiling in which arbitrarily large periodic patches do not occur. A set of tiles is said to be aperiodic if they can form only ...
An Argand diagram is a plot of complex numbers as points z=x+iy in the complex plane using the x-axis as the real axis and y-axis as the imaginary axis. In the plot above, ...
The term "Aristotle gap"' is introduced in this work to refer to the angle between the first and last member of a 5-tetrahedral ring. This gap has angle measure theta = ...
Let P(x) be defined as the power series whose nth term has a coefficient equal to the nth prime p_n, P(x) = 1+sum_(k=1)^(infty)p_kx^k (1) = 1+2x+3x^2+5x^3+7x^4+11x^5+.... (2) ...
The Barth decic is a decic surface in complex three-dimensional projective space having the maximum possible number of ordinary double points, namely 345. It is given by the ...
The Baum-Sweet sequence is the sequence of numbers {b_n} such that b_n=1 if the binary representation of n contains no block of consecutive 0s of odd length, and b_n=0 ...
1 ... 35|36|37|38|39|40|41 ... 82 Previous Next

...