Basic Properties of Primitive Root and Order Function

Na Ma; Xiquan Liang

The search session has expired. Please query the service again.

Displaying similar documents to “Basic Properties of Primitive Root and Order Function”

Proth Numbers

Christoph Schwarzweller (2014)

Formalized Mathematics

Similarity:

In this article we introduce Proth numbers and prove two theorems on such numbers being prime [3]. We also give revised versions of Pocklington’s theorem and of the Legendre symbol. Finally, we prove Pepin’s theorem and that the fifth Fermat number is not prime.

The Perfect Number Theorem and Wilson's Theorem

Marco Riccardi (2009)

Formalized Mathematics

Similarity:

This article formalizes proofs of some elementary theorems of number theory (see [1, 26]): Wilson's theorem (that n is prime iff n > 1 and (n - 1)! ≅ -1 (mod n)), that all primes (1 mod 4) equal the sum of two squares, and two basic theorems of Euclid and Euler about perfect numbers. The article also formally defines Euler's sum of divisors function Φ, proves that Φ is multiplicative and that Σk|n Φ(k) = n.

When the group-counting function assumes a prescribed integer value at squarefree integers frequently, but not extremely frequently

Claudia A. Spiro-Silverman (1992)

Acta Arithmetica

Similarity:

A note on a conjecture of Jeśmanowicz

Moujie Deng, G. Cohen (2000)

Colloquium Mathematicae

Similarity:

Let a, b, c be relatively prime positive integers such that $a^{2} + b^{2} = c^{2}$ . Jeśmanowicz conjectured in 1956 that for any given positive integer n the only solution of ${(a n)}^{x} + {(b n)}^{y} = {(c n)}^{z}$ in positive integers is x=y=z=2. If n=1, then, equivalently, the equation ${(u^{2} - v^{2})}^{x} + {(2 u v)}^{y} = {(u^{2} + v^{2})}^{z}$ , for integers u>v>0, has only the solution x=y=z=2. We prove that this is the case when one of u, v has no prime factor of the form 4l+1 and certain congruence and inequality conditions on u, v are satisfied.

Squares in Lucas sequenceshaving an even first parameter

Paulo Ribenboim, Wayne McDaniel (1998)

Colloquium Mathematicae

Similarity:

Uniqueness of Factoring an Integer and Multiplicative Group Z/pZ*

Hiroyuki Okazaki, Yasunari Shidama (2008)

Formalized Mathematics

Similarity:

In the [20], it had been proven that the Integers modulo p, in this article we shall refer as Z/pZ, constitutes a field if and only if Z/pZ is a prime. Then the prime modulo Z/pZ is an additive cyclic group and Z/pZ* = Z/pZ{0is a multiplicative cyclic group, too. The former has been proven in the [23]. However, the latter had not been proven yet. In this article, first, we prove a theorem concerning the LCM to prove the existence of primitive elements of Z/pZ*. Moreover we prove the...

Set of Points on Elliptic Curve in Projective Coordinates

Yuichi Futa, Hiroyuki Okazaki, Yasunari Shidama (2011)

Formalized Mathematics

Similarity:

In this article, we formalize a set of points on an elliptic curve over GF(p). Elliptic curve cryptography [10], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security.

More on Divisibility Criteria for Selected Primes

Adam Naumowicz, Radosław Piliszek (2013)

Formalized Mathematics

Similarity:

This paper is a continuation of [19], where the divisibility criteria for initial prime numbers based on their representation in the decimal system were formalized. In the current paper we consider all primes up to 101 to demonstrate the method presented in [7].

Steinitz classes of a nonabelian extension of degree $p^{3}$

James Carter (1996)

Colloquium Mathematicae

Similarity:

On systems of composite Lehmer numbers with prime indices

J. Wójcik (1996)

Colloquium Mathematicae

Similarity: