Search Results for ""
561 - 570 of 13135 for Irrational NumberSearch Results

Let c and d!=c be real numbers (usually taken as c=1 and d=0). The Dirichlet function is defined by D(x)={c for x rational; d for x irrational (1) and is discontinuous ...
The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...
The Smarandache function mu(n) is the function first considered by Lucas (1883), Neuberg (1887), and Kempner (1918) and subsequently rediscovered by Smarandache (1980) that ...
The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...
The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...
The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...
Every modular system has a modular system basis consisting of a finite number of polynomials. Stated another way, for every order n there exists a nonsingular curve with the ...
A formula for the number of Young tableaux associated with a given Ferrers diagram. In each box, write the sum of one plus the number of boxes horizontally to the right and ...
Elementary methods consist of arithmetic, geometry, and high school algebra. These are the only tools that may be used in the branch of number theory known as elementary ...
The Fermat number F_n is prime iff 3^(2^(2^n-1))=-1 (mod F_n).

...