TOPICS
Search

Search Results for ""


631 - 640 of 4148 for equation 7Search Results
Abel's integral is the definite integral I = int_0^infty(tdt)/((e^(pit)-e^(-pit))(t^2+1)) (1) = 1/2int_(-infty)^infty(tdt)/((e^(pit)-e^(-pit))(t^2+1)) (2) = ...
"Arabic numerals" are the numerical symbols 1, 2, 3, 4, 5, 6, 7, 8, 9, and 0. Historically, Indian numerals evolved in Arab usage roughly 1000 A.D., and there was rare ...
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) ...
An integer n is p-balanced for p a prime if, among all nonzero binomial coefficients (n; k) for k=0, ..., n (mod p), there are equal numbers of quadratic residues and ...
Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...
In April 1999, Ed Pegg conjectured on sci.math that there were only finitely many zerofree cubes, to which D. Hickerson responded with a counterexample. A few days later, Lew ...
The bead-sorting algorithm orders a list of a positive integers increasingly by representing numbers as a list of a 1s, where each 1 stands for a bead. The k initial integers ...
An interpolation formula, sometimes known as the Newton-Bessel formula, given by (1) for p in [0,1], where delta is the central difference and B_(2n) = 1/2G_(2n) (2) = ...
A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...
A number is said to be biquadratefree (or quarticfree) if its prime factorization contains no quadrupled factors. All primes and prime powers p^n with n<=3 are therefore ...
1 ... 61|62|63|64|65|66|67 ... 415 Previous Next

...