Search Results for ""
12991 - 13000 of 13135 for Semisimple algebraSearch Results
Riemann defined the function f(x) by f(x) = sum_(p^(nu)<=x; p prime)1/nu (1) = sum_(n=1)^(|_lgx_|)(pi(x^(1/n)))/n (2) = pi(x)+1/2pi(x^(1/2))+1/3pi(x^(1/3))+... (3) (Hardy ...
The value for zeta(2)=sum_(k=1)^infty1/(k^2) (1) can be found using a number of different techniques (Apostol 1983, Choe 1987, Giesy 1972, Holme 1970, Kimble 1987, Knopp and ...
There exist infinitely many odd integers k such that k·2^n-1 is composite for every n>=1. Numbers k with this property are called Riesel numbers, while analogous numbers with ...
A right triangle is triangle with an angle of 90 degrees (pi/2 radians). The sides a, b, and c of such a triangle satisfy the Pythagorean theorem a^2+b^2=c^2, (1) where the ...
The Rogers-Ramanujan continued fraction is a generalized continued fraction defined by R(q)=(q^(1/5))/(1+q/(1+(q^2)/(1+(q^3)/(1+...)))) (1) (Rogers 1894, Ramanujan 1957, ...
A run is a sequence of more than one consecutive identical outcomes, also known as a clump. Let R_p(r,n) be the probability that a run of r or more consecutive heads appears ...
Salem constants, sometimes also called Salem numbers, are a set of numbers of which each point of a Pisot number is a limit point from both sides (Salem 1945). The Salem ...
A series is an infinite ordered set of terms combined together by the addition operator. The term "infinite series" is sometimes used to emphasize the fact that series ...
A Sierpiński number of the second kind is a number k satisfying Sierpiński's composite number theorem, i.e., a Proth number k such that k·2^n+1 is composite for every n>=1. ...
The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...
...
View search results from all Wolfram sites (20307 matches)

