English
Related papers

Related papers: The smallest invariant factor of the multiplicativ…

200 papers

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

Number Theory · Mathematics 2024-03-06 Greg Martin , Chau Nguyen

We deduce a simple representation and the invariant factor decompositions of the subgroups of the group $\Bbb{Z}_m \times \Bbb{Z}_n$, where $m$ and $n$ are arbitrary positive integers. We obtain formulas for the total number of subgroups…

Group Theory · Mathematics 2014-10-28 Mario Hampejs , Nicki Holighaus , László Tóth , Christoph Wiesmeyr

The structure of the multiplicative group $M_n = ({\mathbb Z}/n{\mathbb Z})^\times$ encodes a great deal of arithmetic information about the integer $n$ (examples include $\phi(n)$, the Carmichael function $\lambda(n)$, and the number…

Number Theory · Mathematics 2025-04-16 Greg Martin , Reginald M. Simpson

The Carmichael lambda function $\lambda(n)$ is defined to be the smallest positive integer $m$ such that $a^m$ is congruent to 1 modulo $n,$ for all $a$ and $n$ relatively prime. The function $\lambda_k(n)$ is defined to be the $k$th…

Number Theory · Mathematics 2011-11-17 Nick Harland

We examine two counting problems that seem very group-theoretic on the surface but, on closer examination, turn out to concern integers with restrictions on their prime factors. First, given an odd prime $q$ and a finite abelian $q$-group…

Number Theory · Mathematics 2020-07-21 Jenna Downey , Greg Martin

This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. One of the main results of this paper states that if for every $m$ the first $m$ digits of a real number $\alpha\ge…

Group Theory · Mathematics 2007-05-23 Mark Sapir , Jean-Camille Birget , Eliyahu Rips

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$…

Number Theory · Mathematics 2016-07-27 Titus Hilberdink , László Tóth

The minimal excludant statistic, which denotes the smallest positive integer that is not a part of an integer partition, has received great interest in recent years. In this paper, we move on to the smallest positive integer whose frequency…

Number Theory · Mathematics 2025-07-22 Shane Chern , Ernest X. W. Xia

The Landau-Selberg-Delange method provides an asymptotic formula for the partial sums of a multiplicative function whose average value on primes is a fixed complex number $v$. The shape of this asymptotic implies that $f$ can get very small…

Number Theory · Mathematics 2020-05-13 Dimitris Koukoulopoulos , K. Soundararajan

The Carmichael lambda function $\lambda(n)$ is defined to be the smallest positive integer $m$ such that $a^m \equiv 1 \pmod{n}$ for all $(a,n)=1.$ $\lambda_k(n)$ is defined to be the $k$th iterate of $\lambda(n).$ Let L(n) be the smallest…

Number Theory · Mathematics 2012-03-22 Nick Harland

For every positive integer $n$ and for every $\alpha \in [0, 1]$, let $\mathcal{B}(n, \alpha)$ denote the probabilistic model in which a random set $\mathcal{A} \subseteq \{1, \dots, n\}$ is constructed by picking independently each element…

Number Theory · Mathematics 2020-12-10 Carlo Sanna

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…

Number Theory · Mathematics 2026-03-05 Mihoub Bouderbala

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…

Number Theory · Mathematics 2020-06-11 Cristina Ballantine , Mircea Merca

The minimal excludant of an integer partition is the least positive integer missing from the partition. Let $\sigma_o\text{mex}(n)$ (resp., $\sigma_e\text{mex}(n)$) denote the sum of odd (resp., even) minimal excludants over all the…

Number Theory · Mathematics 2023-11-01 Gurinder Singh , Rupam Barman

By a suitable shifting-the-mean parametrization at the Dirichlet series level and Delange's Tauberian theorems, we show that the number of factors in random ordered factorizations of integers is asymptotically normally distributed.

Number Theory · Mathematics 2009-02-20 Hsien-Kuei Hwang , Svante Janson

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

Group Theory · Mathematics 2018-05-16 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Number Theory · Mathematics 2026-05-29 Jan-Hendrik Evertse , Kálmán Győry , Lajos Hajdu , Florian Luca , László Remete

In this paper we present a method for producing asymptotic estimates for the number of integers in a given S having only ``small'' prime factors. The conditions that need to be verified are simpler than those required by other methods, and…

Number Theory · Mathematics 2007-05-23 Ernie Croot

The Landau-Selberg-Delange method gives precise asymptotic formulas for the partial sums $\sum_{n \le x} \, a_n$ of a Dirichlet series $\sum_n \, a_n/n^s$ that behaves like a complex power of the Riemann zeta function. However, situations…

Number Theory · Mathematics 2025-11-21 Akash Singha Roy

We prove asymptotic formulae for small weighted solutions of quadratic congruences of the form $\lambda_1x_1^2+\cdots +\lambda_nx_n^2\equiv \lambda_{n+1}\bmod{p^m}$, where $p$ is a fixed odd prime, $\lambda_1,...,\lambda_{n+1}$ are integer…

Number Theory · Mathematics 2026-01-29 Stephan Baier , Arkaprava Bhandari , Anup Haldar
‹ Prev 1 2 3 10 Next ›