Search Results for ""
1101 - 1110 of 9727 for Numbered Equation 2Search Results
If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.
Two matrices A and B are said to be equal iff a_(ij)=b_(ij) (1) for all i,j. Therefore, [1 2; 3 4]=[1 2; 3 4], (2) while [1 2; 3 4]!=[0 2; 3 4]. (3)
An integer which is expressible in only one way in the form x^2+Dy^2 or x^2-Dy^2 where x^2 is relatively prime to Dy^2. If the integer is expressible in more than one way, it ...
A curve given by the Cartesian equation b^2y^2=x^3(a-x). (1) It has area A=(a^3pi)/(8b). (2) The curvature is kappa(x)=(2b^2(3a^2-12ax+8x^2))/(sqrt(x)[4b^2(a-x)+(3a-4x)^2x]). ...
A Pierpont prime is a prime number of the form p=2^k·3^l+1. The first few Pierpont primes are 2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, ... ...
Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...
Sequences of integers generated in the Collatz problem. For example, for a starting number of 7, the sequence is 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, ...
A doubly stochastic matrix is a matrix A=(a_(ij)) such that a_(ij)>=0 and sum_(i)a_(ij)=sum_(j)a_(ij)=1 is some field for all i and j. In other words, both the matrix itself ...
A number n is called k-hyperperfect if n = 1+ksum_(i)d_i (1) = 1+k[sigma(n)-n-1], (2) where sigma(n) is the divisor function and the summation is over the proper divisors ...
Let L denote the n×n square lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L such ...
...
View search results from all Wolfram sites (480708 matches)

