Search Results for ""
1271 - 1280 of 13135 for Palindromic Number ConjectureSearch Results

A finite group L is quasisimple if L=[L,L] and L/Z(L) is a simple group.
A property of finite simple groups which is known for all such groups.
The generalization of a Voronoi polygon to n dimensions for n>2.
A number n is said to be divisible by d if d is a divisor of n. The function Divisible[n, d] returns True if an integer n is divisible by an integer d. The product of any n ...
Hoffman (1998, p. 90) calls the sum of the exponents in the prime factorization of a number its roundness. The first few values for n=1, 2, ... are 0, 1, 1, 2, 1, 2, 1, 3, 2, ...
A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...
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, ...
Let p be an odd prime, a be a positive number such that pa (i.e., p does not divide a), and let x be one of the numbers 1, 2, 3, ..., p-1. Then there is a unique x^', called ...
A number h which satisfies the conditions of the congruum problem: x^2+h=a^2 and x^2-h=b^2, where x,h,a,b are integers. The list of congrua is given by 24, 96, 120, 240, 336, ...
An Euler pseudoprime to the base b is a composite number n which satisfies b^((n-1)/2)=+/-1 (mod n). The first few base-2 Euler pseudoprimes are 341, 561, 1105, 1729, 1905, ...

...