TOPICS
Search

Search Results for ""


561 - 570 of 2098 for Prime FormulasSearch Results
Baillie and Wagstaff (1980) and Pomerance et al. (1980, Pomerance 1984) proposed a test (or rather a related set of tests) based on a combination of strong pseudoprimes and ...
A Sierpiński number of the first kind is a number of the form S_n=n^n+1. The first few are 2, 5, 28, 257, 3126, 46657, 823544, 16777217, ... (OEIS A014566). Sierpiński proved ...
Thâbit ibn Kurrah's rules is a beautiful result of Thâbit ibn Kurrah dating back to the tenth century (Woepcke 1852; Escott 1946; Dickson 2005, pp. 5 and 39; Borho 1972). ...
The cototient of a positive number n is defined as n-phi(n), where n is the totient function. It is therefore the number of positive integers <=n that have at least one prime ...
A number n is called equidigital if the number of digits in the prime factorization of n (including powers) uses the same number of digits as the number of digits in n. The ...
An object is unique if there is no other object satisfying its defining properties. An object is said to be essentially unique if uniqueness is only referred to the ...
Consider h_+(d) proper equivalence classes of forms with discriminant d equal to the field discriminant, then they can be subdivided equally into 2^(r-1) genera of ...
There are two different statements, each separately known as the greatest common divisor theorem. 1. Given positive integers m and n, it is possible to choose integers x and ...
A generalization of the Kronecker decomposition theorem which states that every finitely generated Abelian group is isomorphic to the group direct sum of a finite number of ...
A mathematical property P holds locally if P is true near every point. In many different areas of mathematics, this notion is very useful. For instance, the sphere, and more ...
1 ... 54|55|56|57|58|59|60 ... 210 Previous Next

...