Search Results for ""
4361 - 4370 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
Ramanujan calculated mu=1.45136380... (Hardy 1999, Le Lionnais 1983, Berndt 1994), while the correct value is mu=1.45136923488... (OEIS A070769; Derbyshire 2004, p. 114). The ...
An l_x table is a tabulation of numbers which is used to calculate life expectancies. x n_x d_x l_x q_x L_x T_x e_x 0 1000 200 1.00 0.20 0.90 2.70 2.70 1 800 100 0.80 0.12 ...
The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...
The homotopy groups generalize the fundamental group to maps from higher dimensional spheres, instead of from the circle. The nth homotopy group of a topological space X is ...
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...
The Legendre polynomials, sometimes called Legendre functions of the first kind, Legendre coefficients, or zonal harmonics (Whittaker and Watson 1990, p. 302), are solutions ...
A phenomenological law also called the first digit law, first digit phenomenon, or leading digit phenomenon. Benford's law states that in listings, tables of statistics, ...
What is the maximum number of queens that can be placed on an n×n chessboard such that no two attack one another? The answer is n-1 queens for n=2 or n=3 and n queens ...
The cosecant cscz is the function defined by cscz = 1/(sinz) (1) = (2i)/(e^(iz)-e^(-iz)), (2) where sinz is the sine. The cosecant is implemented in the Wolfram Language as ...
The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...
...
View search results from all Wolfram sites (505142 matches)

