EuDML | Browse

The paper extends the results given by M. Křížek and L. Somer, On a connection of number theory with graph theory, Czech. Math. J. 54 (129) (2004), 465–485 (see [5]). For each positive integer $n$ define a digraph $Γ (n)$ whose set of vertices is the set $H = {0, 1, \dots, n - 1}$ and for which there is a directed edge from $a \in H$ to $b \in H$ if $a^{3} \equiv b (mod n) .$ The properties of such digraphs are considered. The necessary and the sufficient condition for the symmetry of a digraph $Γ (n)$ is proved. The formula for the number of fixed points of $Γ (n)$ is established....

Pseudoprimes and a generalization of Artin's conjecture

Samuel Wagstaff (1982)

Acta Arithmetica

Displaying 1 – 11 of 11

Partitions quadratiques et cyclotomie

Potenzreste

Première partie du chapitre XIII de la Note sur la théorie des résidus quadratiques.

Primality testing algorithms

Prime k-th power non-residues

Primitive roots and powers among values of polynomials over finite fields.

Primzahlen als achte Potenzreste.

Product formulae on elliptic curves.

Properties of certain integer-valued analogues of Dedekind sums

Properties of digraphs connected with some congruence relations

Pseudoprimes and a generalization of Artin's conjecture

Currently displaying 1 – 11 of 11