Search Results for ""
2801 - 2810 of 3920 for Rationaland Irrational NumbersSearch Results
Consider a network of n resistors R_i so that R_2 may be connected in series or parallel with R_1, R_3 may be connected in series or parallel with the network consisting of ...
A twin prime cluster of order n is a collection of 2n consecutive prime numbers such that consecutive pairs form twin primes. Twin prime clusters were discussed by Mudge ...
The Wythoff array is an interspersion array that can be constructed by beginning with the Fibonacci numbers {F_2,F_3,F_4,F_5,...} in the first row and then building up ...
An n×n magic square for which every pair of numbers symmetrically opposite the center sum to n^2+1. The Lo Shu is associative but not panmagic. The numbers of associative ...
For any sets A and B, their cardinal numbers satisfy |A|<=|B| iff there is a one-to-one function f from A into B (Rubin 1967, p. 266; Suppes 1972, pp. 94 and 116). It is easy ...
A metric space X which is not complete has a Cauchy sequence which does not converge. The completion of X is obtained by adding the limits to the Cauchy sequences. For ...
An improper use of the symbol sqrt(-1) for the imaginary unit leads to the apparent proof of a false statement. sqrt(-1) = sqrt(-1) (1) sqrt((-1)/1) = sqrt(1/(-1)) (2) ...
Let X and Y be sets, and let R subset= X×Y be a relation on X×Y. Then R is a concurrent relation if and only if for any finite subset F of X, there exists a single element p ...
Defining p_0=2, p_n as the nth odd prime, and the nth prime gap as g_n=p_(n+1)-p_n, then the Cramér-Granville conjecture states that g_n<M(lnp_n)^2 for some constant M>1.
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, ...
...


