Add to ORKGWe prove here some properties of primitive roots and indices in Elementary Number Theory by applying Euler\u27s totient function φ(td)/φ(d) on arithmetical progressions[3]
AbstractLet Fq denote the finite field of q elements, q an odd prime power, and let f(x)=xn+∑i=1nfix...
Given a real positive number x, the quantity of prime numbers less than or equal to x is denoted by ...
In this work we will present some basic results of the number theory with the objective of exploring...
We generalize here Euler\u27s totiellt function φ(n) to arithmetical progressions which is new as fa...
The main purpose of this paper is to study the arithmetical properties of the primitive numbers of p...
The Farey sequences can be used [1] to create the Eulers totient function φ(n), by identifying the f...
Euler's totient function f has the property that f(n) is the order of the group U(n) of units ...
Tema ovoga rada su primitivni korijeni, indeksi i njihove primjene. Najprije ćemo uvesti bitne rezul...
Aquest article explica, a un nivell divulgatiu, diversos resultats sobre progressions aritmètiques f...
AbstractLet g∈Q\{−1, 0, 1}. Let p be a prime. Let ordp(g) denote the exponent of p in the canonical ...
Abstract Let \(ξ\) and \(m\) be integers satisfying \(ξ \ne 0\) and \(m ≥ 3\). We show that for any...
U ovom radu bavit ćemo se primitivnim korijenima i indeksima. Definirat ćemo oba pojma, navesti njih...
A primary pseudoperfect number (PPN) is an integer K > 1 such that the reciprocals of K and its prim...
The function φ(n) (the Euler phi function of n, also known as the totient function) gives the number...
AbstractThe function f(θ, φ; x, y) = Σk = 1∞ Σ1 ≤ m ≤ kθ + φ xkym, where θ > 0 is irrational and φ i...
AbstractLet Fq denote the finite field of q elements, q an odd prime power, and let f(x)=xn+∑i=1nfix...
Given a real positive number x, the quantity of prime numbers less than or equal to x is denoted by ...
In this work we will present some basic results of the number theory with the objective of exploring...
We generalize here Euler\u27s totiellt function φ(n) to arithmetical progressions which is new as fa...
The main purpose of this paper is to study the arithmetical properties of the primitive numbers of p...
The Farey sequences can be used [1] to create the Eulers totient function φ(n), by identifying the f...
Euler's totient function f has the property that f(n) is the order of the group U(n) of units ...
Tema ovoga rada su primitivni korijeni, indeksi i njihove primjene. Najprije ćemo uvesti bitne rezul...
Aquest article explica, a un nivell divulgatiu, diversos resultats sobre progressions aritmètiques f...
AbstractLet g∈Q\{−1, 0, 1}. Let p be a prime. Let ordp(g) denote the exponent of p in the canonical ...
Abstract Let \(ξ\) and \(m\) be integers satisfying \(ξ \ne 0\) and \(m ≥ 3\). We show that for any...
U ovom radu bavit ćemo se primitivnim korijenima i indeksima. Definirat ćemo oba pojma, navesti njih...
A primary pseudoperfect number (PPN) is an integer K > 1 such that the reciprocals of K and its prim...
The function φ(n) (the Euler phi function of n, also known as the totient function) gives the number...
AbstractThe function f(θ, φ; x, y) = Σk = 1∞ Σ1 ≤ m ≤ kθ + φ xkym, where θ > 0 is irrational and φ i...
AbstractLet Fq denote the finite field of q elements, q an odd prime power, and let f(x)=xn+∑i=1nfix...
Given a real positive number x, the quantity of prime numbers less than or equal to x is denoted by ...
In this work we will present some basic results of the number theory with the objective of exploring...