Search Results for ""
2041 - 2050 of 2400 for Dense SetSearch Results
The Rayleigh functions sigma_n(nu) for n=1, 2, ..., are defined as sigma_n(nu)=sum_(k=1)^inftyj_(nu,k)^(-2n), where +/-j_(nu,k) are the zeros of the Bessel function of the ...
The regular hendecagon is the regular polygon with 11 sides, as illustrated above, and has Schläfli symbol {11}. The regular hendecagon cannot be constructed using the ...
The regular octagon is the regular polygon with eight sides, as illustrated above. The inradius r, circumradius R, and area A of the regular octagon can be computed directly ...
An analytic function f(z) whose Laurent series is given by f(z)=sum_(n=-infty)^inftya_n(z-z_0)^n, (1) can be integrated term by term using a closed contour gamma encircling ...
Given a map f:S->T between sets S and T, the map g:T->S is called a right inverse to f provided that f degreesg=id_T, that is, composing f with g from the right gives the ...
There exists a positive integer s such that every sufficiently large integer is the sum of at most s primes. It follows that there exists a positive integer s_0>=s such that ...
Let I_A, I_B, and I_C be the vertices of the inner Soddy triangle, and also let E_A, E_B, and E_C be the pairwise contact points of the three tangent circles. Then the lines ...
Let A be a C^*-algebra. An element a in A is called self-adjoint if a^*=a. For example, the real functions of the C^*-algebra of C([a,b]) of continuous complex-valued ...
The nth Smarandache-Wellin number is formed from the consecutive number sequence obtained by concatenating of the digits of the first n primes. The first few are 2, 23, 235, ...
SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...
...
View search results from all Wolfram sites (33373 matches)

