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

We introduce a class of convolutions on arithmetical functions that are regular in the sense of of Narkiewicz, homogeneous in the sense of Burnett et al, and bounded, in the sense that there exists a common finite bound for the rank of…

Let $q=p^k$ be a prime power, let $\mathbb{F}_q$ be a finite field and let $n\geq2$ be an integer. This note investigates the existence small primitive normal elements in finite field extensions $\mathbb{F}_{q^n}$. It is shown that a small…

Let $r$, $n$ be positive integers, $k$ be a non-negative integer and $q$ be any prime power such that $r\mid q^n-1.$ An element $\alpha$ of the finite field $\mathbb{F}_{q^n}$ is called an {\it $r$-primitive} element, if its multiplicative…

Let $P_k$ be the subgroup generated by $k$th powers of primitive elements in $F_r$, the free group of rank $r$. We show that $F_2/P_k$ is finite if and only if $k$ is $1$, $2$, or $3$. We also fully characterize $F_2/P_k$ for $k = 2,3,4$.…

A subset $A$ of a group $G$ is called $(k, l)$-{\it sumset}, if $A= kB-lB$ for some $B\subseteq G$, where $kB-lB={x_1+...+x_k-x_{k+1}-...-x_{k+l} : x_1,..., x_{k+l}\in B}.$ Upper and lower bounds for the number $(k, l)$-sumsets in groups of…

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

A number field $K$ is primitive if $K$ and $\mathbb{Q}$ are the only subextensions of $K$. Let $C$ be a curve defined over $\mathbb{Q}$. We call an algebraic point $P\in C(\overline{\mathbb{Q}})$ primitive if the number field…

We study the number of primes with a given primitive root and in an arithmetic progression under the assumption of a suitable form of the generalized Riemann Hypothesis. Previous work of Lenstra, Moree and Stevenhagen has given asymptotics…

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

The sets of primitive foms may be decomposed into some Galois conjugacy classes. The purpose of this paper is to write down all of such classes with cardinal 1 or 2, explicitly in terms of some Eisenstein series, for level 1,2,3,4,6,8,9.…

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

We study the primitive divisors of the terms of $(\Delta_n)_{n \geq 1}$, where $\Delta_n=N_{K/ \mathbb{Q}}(u^n-1)$ for $K$ a real quadratic field, and $u>1$ a unit element of its ring of integers. The methods used allow us to find the terms…

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

Let $E$ be any directed graph, and $K$ any field. We classify those graphs $E$ for which the Leavitt path algebra $L_K(E)$ is primitive. As a consequence, we obtain classes of examples of von Neumann regular prime rings which are not…

An integer is a primitive root modulo a prime $p$ if it generates the whole multiplicative group $(\mathbb{Z}/p\mathbb{Z})^*$. In 1927 Artin conjectured that an integer $a$ which is not $-1$ or a square is a primitive root for infintely…

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of…

In 2023, the author presented the first computable minimal Euclidean function for a non-trivial number field. Along with a formula for $\phi_{\mathbb{Z}[i]}$, the minimal Euclidean function on the Gaussian inteers, the same paper introduced…

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…