TOPICS
Search

Search Results for ""


411 - 420 of 1809 for Factorization SequenceSearch Results
The second-order ordinary differential equation (1-x^2)y^('')-2(mu+1)xy^'+(nu-mu)(nu+mu+1)y=0 (1) sometimes called the hyperspherical differential equation (Iyanaga and ...
The number of elements in a group G, denoted |G|. If the order of a group is a finite number, the group is said to be a finite group. The order of an element g of a finite ...
The Gelfond-Schneider constant is sometimes known as the Hilbert number. Flannery and Flannery (2000, p. 35) define a Hilbert number as a positive integer of the form n=4k+1 ...
If A and B are commutative unit rings, and A is a subring of B, then A is called integrally closed in B if every element of B which is integral over A belongs to A; in other ...
The Janko groups are the four sporadic groups J_1, J_2, J_3 and J_4. The Janko group J_2 is also known as the Hall-Janko group. The Janko groups are implemented in the ...
A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...
A modification of Legendre's formula for the prime counting function pi(x). It starts with |_x_| = (1) where |_x_| is the floor function, P_2(x,a) is the number of integers ...
A multiplicative number theoretic function is a number theoretic function f that has the property f(mn)=f(m)f(n) (1) for all pairs of relatively prime positive integers m and ...
A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...
k+2 is prime iff the 14 Diophantine equations in 26 variables wz+h+j-q=0 (1) (gk+2g+k+1)(h+j)+h-z=0 (2) 16(k+1)^3(k+2)(n+1)^2+1-f^2=0 (3) 2n+p+q+z-e=0 (4) ...
1 ... 39|40|41|42|43|44|45 ... 181 Previous Next

...