Search Results for ""
521 - 530 of 3632 for Diophantine Equation 2nd PowersSearch Results
![](/common/images/search/spacer.gif)
If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...
A number which is simultaneously a heptagonal number Hep_n and hexagonal number Hex_m. Such numbers exist when 1/2n(5n-3)=m(2m-1). (1) Completing the square and rearranging ...
A number which is simultaneously a heptagonal number H_n and pentagonal number P_m. Such numbers exist when 1/2n(5n-3)=1/2m(3m-1). (1) Completing the square and rearranging ...
A number which is simultaneously a pentagonal number P_n and triangular number T_m. Such numbers exist when 1/2n(3n-1)=1/2m(m+1). (1) Completing the square gives ...
For algebraic alpha |alpha-p/q|<1/(q^(2+epsilon)), with epsilon>0, has finitely many solutions. Klaus Roth received a Fields medal for this result.
Let X be a metric space, A be a subset of X, and d a number >=0. The d-dimensional Hausdorff measure of A, H^d(A), is the infimum of positive numbers y such that for every ...
Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...
Zeros of the Riemann zeta function zeta(s) come in two different types. So-called "trivial zeros" occur at all negative even integers s=-2, -4, -6, ..., and "nontrivial ...
The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...
Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...
![](/common/images/search/spacer.gif)
...