Search Results for ""
6981 - 6990 of 13135 for Use of computers and internetSearch Results
The Faulkner-Younger graphs (Faulkner and Younger 1974) are the cubic polyhedral nonhamiltonian graphs on 42 and 44 vertices illustrated above that are counterexamples to ...
Let T_n(x) be an arbitrary trigonometric polynomial T_n(x)=1/2a_0+{sum_(k=1)^n[a_kcos(kx)+b_ksin(kx)]} (1) with real coefficients, let f be a function that is integrable over ...
The Feit-Thompson conjecture asserts that there are no primes p and q for which (p^q-1)/(p-1) and (q^p-1)/(q-1) have a common factor. Parker noticed that if this were true, ...
Every finite simple group (that is not cyclic) has even group order, and the group order of every finite simple noncommutative group is doubly even, i.e., divisible by 4 ...
Given a sequence of independent random variates X_1, X_2, ..., if sigma_k^2=var(X_k) and rho_n^2=max_(k<=n)((sigma_k^2)/(s_n^2)), then lim_(n->infty)rho_n^2=0. This means ...
The Feller-Tornier constant is the density of integers that have an even number of prime factors p_i^(a_i) with a_1>1 in their prime factorization. It is given by ...
The Fermat axis is the central line connecting the first and second Fermat points. It has line function l=a(b^2-c^2)(a^2-b^2-bc-c^2)(a^2-b^2+bc-c^2), corresponding to ...
The Fermat quotient for a number a and a prime base p is defined as q_p(a)=(a^(p-1)-1)/p. (1) If pab, then q_p(ab) = q_p(a)+q_p(b) (2) q_p(p+/-1) = ∓1 (3) (mod p), where the ...
In 1657, Fermat posed the problem of finding solutions to sigma(x^3)=y^2, and solutions to sigma(x^2)=y^3, where sigma(n) is the divisor function (Dickson 2005). The first ...
The converse of Fermat's little theorem is also known as Lehmer's theorem. It states that, if an integer x is prime to m and x^(m-1)=1 (mod m) and there is no integer e<m-1 ...
...
View search results from all Wolfram sites (204332 matches)

