Note on the number of solutions of the congruence $f(x_1,x_2,\dots , x_n)\equiv 0\hspace{4.44443pt}(\@mod \; p)$

Stanislav Jakubec

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Note on the number of solutions of the congruence $f (x_{1}, x_{2}, \dots, x_{n}) \equiv 0 (mod p)$ ”

The cube of the Fermat quotient.

Dilcher, Karl, Skula, Ladislav (2006)

Integers

Similarity:

On power residues

Andrzej Schinzel (1975)

Acta Arithmetica

Similarity:

Tribonacci modulo $p^{t}$

Jiří Klaška (2008)

Mathematica Bohemica

Similarity:

Our research was inspired by the relations between the primitive periods of sequences obtained by reducing Tribonacci sequence by a given prime modulus $p$ and by its powers $p^{t}$ , which were deduced by M. E. Waddill. In this paper we derive similar results for the case of a Tribonacci sequence that starts with an arbitrary triple of integers.

The square of the Fermat quotient.

Granville, Andrew (2004)

Integers

Similarity:

Displaying similar documents to “Note on the number of solutions of the congruence f ( x 1 , x 2 , ⋯ , x n ) ≡ 0 ( mod p ) ”

The cube of the Fermat quotient.

On power residues

Tribonacci modulo p t

The square of the Fermat quotient.

Displaying similar documents to “Note on the number of solutions of the congruence $f (x_{1}, x_{2}, \dots, x_{n}) \equiv 0 (mod p)$ ”

Tribonacci modulo $p^{t}$