English
Related papers

Related papers: Regular integers modulo n

200 papers

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…

Number Theory · Mathematics 2019-10-22 Kevin Ford

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

Combinatorics · Mathematics 2024-03-07 Paweł Hitczenko

Let $A$ be an infinite set of natural numbers. For $n\in \mathbb{N}$, let $r(A, n)$ denote the number of solutions of the equation $n=a+b$ with $a, b\in A, a\le b$. Let $|A(x)|$ be the number of integers in $A$ which are less than or equal…

Number Theory · Mathematics 2022-01-27 Yong-Gao Chen , Hui Lv

Euler showed that if an odd perfect number exists, it must be of the form $N = p^\alpha q_{1}^{2\beta_{1}}$ $\ldots$ $q_{k}^{2\beta_{k}}$, where $p, q_{1}, \ldots, q_k$ are distinct odd primes, $\alpha$, $\beta_{i} \geq 1$, for $1 \leq i…

Number Theory · Mathematics 2015-12-07 Patrick Brown

We compute the ring of non-induced representations for a cyclic group, $C_n$, over an arbitrary field and show that it has rank $\varphi(n)$, where $\varphi$ is Euler's totient function - independent of the characteristic of the field.…

Representation Theory · Mathematics 2021-11-18 Liam Jolliffe , Robert A. Spencer

Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…

Combinatorics · Mathematics 2024-12-18 Christian Táfula

Based on elementary methods and techniques, the explicit formula for the generalized Euler function $\varphi_{e}(n)(e=8,12)$ is given, and then a sufficient and necessary condition for $\varphi_{8}(n)$ or $\varphi_{12}(n)$ to be odd is…

Number Theory · Mathematics 2021-12-24 Shichun Yang , Qunying Liao , Shan Du , Huili Wang

An integer of the form $T_x=\frac{x(x+1)}2$ for some positive integer $x$ is called a triangular number. A ternary triangular form $aT_{x}+bT_{y}+cT_{z}$ for positive integers $a,b$ and $c$ is called regular if it represents every positive…

Number Theory · Mathematics 2019-03-11 Mingyu Kim , Byeong-Kweon Oh

Let $d(n)$ denote the number of divisors of $n$. In this paper, we study the average value of $d(a(p))$, where $p$ is a prime and $a(p)$ is the $p$-th Fourier coefficient of a normalized Hecke eigenform of weight $k \ge 2$ for $\Gamma_0(N)$…

Number Theory · Mathematics 2014-03-20 Sanoli Gun , M. Ram Murty

A (positive definite and integral) quadratic form $f$ is called regular if it represents all integers that are locally represented. It is known that there are only finitely many regular ternary quadratic forms up to isometry. However, there…

Number Theory · Mathematics 2021-11-22 Mingyu Kim , Byeong-Kweon Oh

Fix a positive integer $N\geq2$. For a real number $x\in[0,1]$ and a digit $i\in\{0, 1,...,N-1\}$, let $\Pi_i(x, n)$ denote the frequency of the digit $i$ among the first $n$ $N$-adic digits of $x$. It is well-known that for a typical (in…

Number Theory · Mathematics 2021-01-20 Anastasios Stylianou

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

Combinatorics · Mathematics 2020-07-10 Sanjay Ramassamy

We consider the regular parts for basic functions of prime numbers with Riemann approximation accuracy.

Number Theory · Mathematics 2007-05-23 R. M. Abrarov , S. M. Abrarov

Let $f(n)$ be a Steinhaus random multiplicative function. Let $A\subset [1, N]$ be a finite set of integers. We show that \[\frac{1}{\sqrt{|A|}} \sum_{n\in A} f(n) \xrightarrow[]{d} \mathcal{CN}(0,1)\] forces that $|A|=o(N)$. We prove that…

Number Theory · Mathematics 2026-05-26 Max Wenqiang Xu

Let n,d be positive integers, with d even (say d=2e). Let X_(n,d) denote the locus of degree d hypersurfaces in P^n which consist of two e-fold hyperplanes. We bound the regularity of the ideal of this variety. Moreover, we show that this…

Algebraic Geometry · Mathematics 2009-09-29 Abdelmalek Abdesselam , Jaydeep Chipalkatti

Recently, Hirschhorn and the first author considered the parity of the function $a(n)$ which counts the number of integer partitions of $n$ wherein each part appears with odd multiplicity. They derived an effective characterization of the…

Combinatorics · Mathematics 2022-04-05 James A. Sellers , Fabrizio Zanello

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

Number Theory · Mathematics 2019-05-01 Gérald Tenenbaum

Let $d(n)$ be the number of divisors of $n$. We investigate the average value of $d(a_f(p))^r$ for $r$ a positive integer and $a_f(p)$ the $p$-th Fourier coefficient of a cuspidal eigenform $f$ having integral Fourier coefficients, where…

Number Theory · Mathematics 2026-03-30 Yuk-Kam Lau , Wonwoong Lee

A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. A "nice" Friedman number is a Friedman number for…

Number Theory · Mathematics 2013-10-10 Michael Brand

A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its…

Number Theory · Mathematics 2019-11-20 Hao Zhong , Tianxin Cai
‹ Prev 1 4 5 6 7 8 10 Next ›