Search Results for ""
2311 - 2320 of 8520 for 1Search Results
Given an arithmetic progression of terms an+b, for n=1, 2, ..., the series contains an infinite number of primes if a and b are relatively prime, i.e., (a,b)=1. This result ...
The Euler formula, sometimes also called the Euler identity (e.g., Trott 2004, p. 174), states e^(ix)=cosx+isinx, (1) where i is the imaginary unit. Note that Euler's ...
Given an m×n matrix A, the fundamental theorem of linear algebra is a collection of results relating various properties of the four fundamental matrix subspaces of A. In ...
A number n for which the harmonic mean of the divisors of n, i.e., nd(n)/sigma(n), is an integer, where d(n)=sigma_0(n) is the number of positive integer divisors of n and ...
A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...
A Fourier series-like expansion of a twice continuously differentiable function f(x)=1/2a_0+sum_(n=1)^inftya_nJ_0(nx) (1) for 0<x<pi, where J_0(x) is a zeroth order Bessel ...
A number (usually base 10 unless specified otherwise) which has no digitaddition generator. Such numbers were originally called Colombian numbers (S. 1974). There are ...
The spherical curve taken by a ship which travels from the south pole to the north pole of a sphere while keeping a fixed (but not right) angle with respect to the meridians. ...
The Weierstrass zeta function zeta(z;g_2,g_3) is the quasiperiodic function defined by (dzeta(z;g_2,g_3))/(dz)=-P(z;g_2,g_3), (1) where P(z;g_2,g_3) is the Weierstrass ...
Let sopfr(n) be the sum of prime factors (with repetition) of a number n. For example, 20=2^2·5, so sopfr(20)=2+2+5=9. Then sopfr(n) for n=1, 2, ... is given by 0, 2, 3, 4, ...
...
View search results from all Wolfram sites (501144 matches)

