English
Related papers

Related papers: On odd deficient-perfect numbers with four distinc…

200 papers

Let $(M_n)_{n\geq0}$ be the Mersenne sequence defined by $M_n=2^n-1$. Let $\omega(n)$ be the number of distinct prime divisors of $n.$ In this short note, we present a description of the Mersenne numbers satisfying $\omega(M_n)\leq3$.…

Number Theory · Mathematics 2021-04-29 Ady Cambraia , Michael P. Knapp , Abílio Lemos , B. K. Moriya , Paulo H. A. Rodrigues

Let $n \in \mathbb{Z}_{\geqslant 2}$. By $P(n)$ we denote the set of all prime divisors of the integers in the sequence $n, n^2-1, (n^2-1)^2-1, \dots$. We ask whether the set $P(n)$ determines $n$ uniquely under the assumption that $n \neq…

Number Theory · Mathematics 2025-11-12 Ivan Penkov , Michael Stoll

Let $n$ be a positive square-free integer, where every odd prime factor of $n$ has form $8a\pm 1$. We determine when $n$ is non-congruent with second minimal $2$-primary Shafarevich-Tate group, in terms of the $4$-ranks of class groups and…

Number Theory · Mathematics 2021-11-24 Shenxing Zhang

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

Number Theory · Mathematics 2010-02-25 Li-Lu Zhao , Zhi-Wei Sun

For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…

Number Theory · Mathematics 2020-10-12 Andrej Dujella , Vinko Petričević

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

Number Theory · Mathematics 2023-12-05 William Banks , Igor E. Shparlinski

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

General Mathematics · Mathematics 2021-08-24 Masum Billal

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…

Number Theory · Mathematics 2014-09-16 Yong-Gao Chen , Xiao-Feng Zhou

Given a finite set of primes $S$ and a $m$-tuple $(a_1,\dots,a_m)$ of positive, distinct integers we call the $m$-tuple $S$-Diophantine, if for each $1\leq i < j\leq m$ the quantity $a_ia_j+1$ has prime divisors coming only from the set…

Number Theory · Mathematics 2020-10-23 Volker Ziegler

Let $P$ be a non-torsion point on the elliptic curve $E_{a}: y^{2}=x^{3}+ax$. We show that if $a$ is fourth-power-free and either $n>2$ is even or $n>1$ is odd with $x(P)<0$ or $x(P)$ a perfect square, then the $n$-th element of the…

Number Theory · Mathematics 2011-12-06 Paul Voutier , Minoru Yabuta

We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…

General Mathematics · Mathematics 2019-01-01 Debayan Gupta , Mayuri Sridhar

We prove that an odd number is an Euler pseudoprime for exactly one half of the admissible bases if and only if it is a special Carmichael number.

Number Theory · Mathematics 2011-09-19 Lorenzo Di Biagio

Let $\omega^*(n)$ denote the number of divisors of $n$ that are shifted primes, that is, the number of divisors of $n$ of the form $p-1$, with $p$ prime. Studied by Prachar in an influential paper from 70 years ago, the higher moments of…

Number Theory · Mathematics 2024-03-20 Steve Fan , Carl Pomerance

A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…

Number Theory · Mathematics 2023-11-28 Sai Teja Somu , Andrzej Kukla , Duc Van Khanh Tran

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Number Theory · Mathematics 2025-06-04 Ritesh Dwivedi , Rohit Yadav

We define S(um)anD(ifference) numbers as ordered pairs $(m,\, m+\Delta)$ such that the digital-sum $DS(m(m+\Delta))=\Delta.$ We consider both the decimal and the binary case. If both $m$ and $m+\Delta$ are prime numbers, we refer to SanD…

Classical Analysis and ODEs · Mathematics 2020-03-04 Freeman J. Dyson , Norman E. Frankel , Anthony J. Guttmann

Let $h\geq 2$ be a positive integer. For any subset $\mathcal{A}\subset \mathbb{Z}_n$, let $h^{\wedge}\mathcal{A}$ be the set of the elements of $\mathbb{Z}_n$ which are sums of $h$ distinct elements of $\mathcal{A}$. In this paper, we…

Number Theory · Mathematics 2018-10-19 Min Tang , Meng-Ting Wei

Fix a field $F$. In this paper, we study the sets $\D_F(n) \subset [0,n]$ defined by [\D_F(n):= {0 \leq m \leq n: T^n-1\text{has a divisor of degree $m$ in} F[T]}.] When $\D_F(n)$ consists of all integers $m$ with $0 \leq m \leq n$, so that…

Number Theory · Mathematics 2012-06-12 Paul Pollack , Lola Thompson

In this paper we show that for every positive integer $n$ there exists a prime number in the interval $[n,9(n+3)/8]$. Based on this result, we prove that if $a$ is an integer greater than 1, then for every integer $n>14.4a$ there are at…

Number Theory · Mathematics 2013-09-03 Germán Paz

Let $\mathbb{Z}_n$ denote the ring of integers modulo $n$. In this paper we consider two extremal problems on permutations of $\mathbb{Z}_n$, namely, the maximum size of a collection of permutations such that the sum of any two distinct…

Combinatorics · Mathematics 2014-02-18 L. Sunil Chandran , Deepak Rajendraprasad , Nitin Singh