English
Related papers

Related papers: Regular integers modulo n

200 papers

Congruences modulo prime powers involving generalized Harmonic numbers are known. While looking for similar congruences, we have encountered a curious triangular array of numbers indexed with positive integers $n,k$, involving the Bernoulli…

Combinatorics · Mathematics 2020-08-04 René Gy

Following Cayley, MacMahon, and Sylvester, define a non-unitary partition to be an integer partition with no part equal to one, and let $\nu(n)$ denote the number of non-unitary partitions of size $n$. In a 2021 paper, the sixth author…

We present a theorem which generalizes the classical Euler's theorem on congruencies: if $(a,m)=1$ then $a^ \phi(m) \equiv 1 (mod m)$ for the case when $a$ and $m$ are not relatively primes.

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

In a prime number decomposition of integers in a given set, the occurrence frequencies of prime numbers are shown to satisfy a general forms of Zipf's law.

Physics and Society · Physics 2024-03-20 Helmut Satz

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

Number Theory · Mathematics 2019-01-25 Fabián Arias , Jerson Borja , Luis Rubio

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

Combinatorics · Mathematics 2025-11-07 George E. Andrews , Rahul Kumar , Ae Ja Yee

A triangular form is defined to be an integer-valued quadratic polynomial of the form $a_1P_3(x_1)+a_2P_3(x_2)+\cdots+a_kP_3(x_k)$ where $a_i's$ are positive integers and $P_3(x)=x(x+1)/2$. A triangular form is called regular if it…

Number Theory · Mathematics 2022-09-28 Mingyu Kim

We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…

Number Theory · Mathematics 2017-04-13 Verónica Becher , Sergio A. Yuhjtman

Let $n$ be a positive integer and $\alpha_n$ be the arithmetic function which assigns the multiplicative order of $a^n$ modulo $n$ to every integer $a$ coprime to $n$ and vanishes elsewhere. Similarly, let $\beta_n$ assign the projective…

Number Theory · Mathematics 2016-03-24 Jonathan Chappelon

Let A be a set of integers. For every integer n, let r_{A,h}(n) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,...,a_h are in A and a_1 \leq a_2 \leq ... \leq a_h. The function r_{A,h}: Z \to…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in…

Number Theory · Mathematics 2024-07-11 William Craig , Jan-Willem van Ittersum , Ken Ono

In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…

Number Theory · Mathematics 2026-03-23 Kathrin Bringmann , Min-Joo Jang , Ben Kane , Cheuk Hin Alvin Tse

Let us denote by $\tau(n)$ and $\si(n)$ the number and the sum of the divisors of $n$ and by $\vfi$ Euler's function. We give effective upper bounds for $\frac{n}{\vfi(n)}$ in terms of $\vfi(n)$, and for $\frac{\si(n)}{n}$ in terms of…

Number Theory · Mathematics 2008-12-18 Jean-Louis Nicolas

We consider the distribution in residue classes modulo primes $p$ of Euler's totient function $\phi(n)$ and the sum-of-proper-divisors function $s(n):=\sigma(n)-n$. We prove that the values $\phi(n)$, for $n\le x$, that are coprime to $p$…

Number Theory · Mathematics 2021-05-28 Noah Lebowitz-Lockard , Paul Pollack , Akash Singha Roy

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

Number Theory · Mathematics 2013-02-27 Sadegh Nazardonyavi , Semyon Yakubovich

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

Number Theory · Mathematics 2021-02-10 Sungjin Kim

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

Number Theory · Mathematics 2020-03-23 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

Let $n\geq 1,0<\rho<1, \max\{\rho,1-\rho\}\leq \delta\leq 1$ and $$m_1=\rho-n+(n-1)\min\{\frac 12,\rho\}+\frac {1-\delta}{2}.$$ If the amplitude $a$ belongs to the H\"{o}rmander class $S^{m_1}_{\rho,\delta}$ and $\phi\in \Phi^{2}$ satisfies…

Classical Analysis and ODEs · Mathematics 2024-08-29 Xiangrong Zhu , Wenjuan Li

Let m(n) be the number of ordered factorizations of n in factors larger than 1. We prove that for every eps>0 n^{rho} m(n) < exp[(log n)^{1/rho}/(loglog n)^{1+eps}] holds for all integers n>n_0, while, for a constant c>0, n^{rho} m(n) >…

Number Theory · Mathematics 2007-05-23 Martin Klazar , Florian Luca

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

Number Theory · Mathematics 2007-05-23 Pieter Moree