TOPICS
Search

Search Results for ""


341 - 350 of 2327 for Even IntegerSearch Results
The constants C_n defined by C_n=[int_0^infty|d/(dt)((sint)/t)^n|dt]-1. (1) These constants can also be written as the sums C_n=2sum_(k=1)^infty(1+x_k^2)^(-n/2), (2) and ...
An invariant of an elliptic curve given in the form y^2=x^3+ax+b which is closely related to the elliptic discriminant and defined by j(E)=(2^83^3a^3)/(4a^3+27b^2). The ...
Let a divisor d of n be called a 1-ary (or unitary) divisor if d_|_n/d (i.e., d is relatively prime to n/d). Then d is called a k-ary divisor of n, written d|_kn, if the ...
Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...
Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...
The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...
The absolute value of a real number x is denoted |x| and defined as the "unsigned" portion of x, |x| = xsgn(x) (1) = {-x for x<=0; x for x>=0, (2) where sgn(x) is the sign ...
The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...
An antimagic square is an n×n array of integers from 1 to n^2 such that each row, column, and main diagonal produces a different sum such that these sums form a sequence of ...
The Beatty sequence is a spectrum sequence with an irrational base. In other words, the Beatty sequence corresponding to an irrational number theta is given by |_theta_|, ...
1 ... 32|33|34|35|36|37|38 ... 233 Previous Next

...