相关论文: Primitive sets and an Euler phi function for subse…

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

Let $k\ge 1,a\ge 1,b\ge 0$ and $ c\ge 1$ be integers. Let $f$ be a multiplicative function with $f(n)\ne 0$ for all positive integers $n$. We define the arithmetic function $g_{k,f}$ for any positive integer $n$ by…

Let $z\ne \pm1,w^2$ be a fixed integer, and let $f(t)\ne g(t)^2$ be a fixed polynomial over the integers. It is shown that the subset of primes $p\geq 2$ such that $z$ and $f(z)$ is a pair of simultaneous primitive roots modulo $p$ has…

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Given a finite group $G$, let $Cent(G)$ denote the set of distinct centralizers of elements of $G$. The group $G$ is called $n$-centralizer if $|Cent(G)|=n$ and primitive $n$-centralizer if $|Cent(G)|=|Cent(\frac{G}{Z(G)})|=n$. In this…

Let $k$ be a field and let $R$ be a countable dimensional prime von Neumann regular $k$-algebra. We show that $R$ is primitive, answering a special case of a question of Kaplansky.

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements. For a positive divisor $r$ of $q^n-1$, the element $\alpha \in \mathbb{F}_{q^n}^*$ is called \textit{$r$-primitive} if its multiplicative order is $(q^n-1)/r$. Also, for a…

The Euler phi function on a given integer $n$ yields the number of positive integers less than $n$ that are relatively prime to $n$. Equivalently, it gives the order of the group of units in the quotient ring $\mathbb{Z}/(n)$. We generalize…

In this paper, a new formula for {\pi}^(2)(N) is formulated, it is a function that counts the number of semi-primes not exceeding a given number N. A semi-prime is a natural number that is the product of precisely two prime numbers, the two…

Let $p \geq 2$ be a large prime, and let $k \ll \log p $ be a small integer. This note proves the existence of various configurations of $(k+1)$-tuples of consecutive and quasi consecutive primitive roots $n+a_0, n+a_1, n+a_2, \ldots,…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

Suppose that $k\geq 2$ and $A$ is a non-empty subset of a finite abelian group $G$ with $|G|>1$. Then the cardinality of the restricted sumset $$ k^\wedge A:=\{a_1+\cdots+a_k:\,a_1,\ldots,a_k\in A,\ a_i\neq a_j\text{ for }i\neq j\} $$ is at…

A transitive group $G$ of permutations of a set $\Omega$ is primitive if the only $G$-invariant equivalence relations on $\Omega$ are the trivial and universal relations. If $\alpha \in \Omega$, then the orbits of the stabiliser $G_\alpha$…

In this paper, we first investigate the relationship between the number of primitive representations of $n$ by quadratic forms and the number of non-primitive ones. We hence obtain a theorem to deal with the Eisenstein series part with…

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…

A \textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is…

A group $G$ is said to be $k$-generated if it has a generating set with $k$ elements. A positive integer $n$ is called a \emph{2-generated number} if every group of order $n$ is 2-generated. In this article, we establish an arithmetic…

Using the properties of the ideal of the coordinate Hermite interpolation on n-dimensional grid [4], we prove that the extension k in k[x1, x2, ..., xn] / (f1(x1), ..., fn(xn)) has a primitive element if and only if at most one of the…

We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, $\mathbb{F}_{q^n}$, small $q$ and large $n$, we show that the set of all low degree polynomials…