TOPICS
Search

Search Results for ""


661 - 670 of 2617 for Prime Generating PolynomialSearch Results
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 ...
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 ...
Let a divisor d of n be called a 1-ary (or unitary) divisor if d_|_n/d (i.e., d is relatively prime to n/d). Then d is called a k-ary divisor of n, written d|_kn, if the ...
A p-adic integer is a p-adic number of the form sum_(k=m)^(infty)a_kp^k, where m>=0, a_k are integers, and p is prime. It is sufficient to take a_k in the set {0,1,...,p-1}. ...
A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...
1 ... 64|65|66|67|68|69|70 ... 262 Previous Next

...