Search Results for ""

Number Theory

Every irrational number x has an approximation constant c(x) defined by c(x)=lim inf_(q->infty)q|qx-p|, where p=nint(qx) is the nearest integer to qx and lim inf is the ...

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 ...

The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...

A pair of prime numbers (p,q) such that p^(q-1)=1 (mod q^2) and q^(p-1)=1 (mod p^2). The only known examples are (2, 1093), (3, 1006003), (5 , 1645333507), (83, 4871), (911, ...

An integer d is a fundamental discriminant if it is not equal to 1, not divisible by any square of any odd prime, and satisfies d=1 (mod 4) or d=8,12 (mod 16). The function ...

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 heptagonal number H_n and square number S_m. Such numbers exist when 1/2n(5n-3)=m^2. (1) Completing the square and rearranging gives ...

A number which is simultaneously a heptagonal number H_n and triangular number T_m. Such numbers exist when 1/2n(5n-3)=1/2m(m+1). (1) Completing the square and rearranging ...