中文
相关论文

相关论文: Friends of 12

200 篇论文

Let $N$ be an odd perfect number. Then, Euler proved that there exist some integers $n, \alpha$ and a prime $q$ such that $N = n^{2}q^{\alpha}$, $q \nmid n$, and $q \equiv \alpha \equiv 1 \bmod 4$. In this note, we prove that the ratio…

数论 · 数学 2023-12-01 Yoshinosuke Hirakawa

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

数论 · 数学 2012-04-10 Victor J. W. Guo , Jiang Zeng

While solving a special case of a question of Erd\H{o}s and Graham Steinerberger asks for all integers $n$ with $\phi(n)=\frac{2}{3} \cdot (n+1)$. He discovered the solutions $n\in\{5, 5 \cdot 7, 5\cdot 7\cdot 37, 5\cdot 7\cdot 37\cdot…

数论 · 数学 2025-04-29 Christian Hercher

Let $m \in \mathbb{N}$ be large. We show that there exist infinitely many primes $q_{1}< \cdot\cdot\cdot < q_{m+1}$ such that \[ q_{m+1}-q_{1}=O(e^{7.63m}) \] and $q_{j}+2$ has at most \[ \frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21…

数论 · 数学 2025-07-17 Bin Chen

A finite group G is exceptional if it has a quotient Q whose minimal faithful permutation degree is greater than that of G. We say that Q is a distinguished quotient. The smallest examples of exceptional p-groups have order p^5. For an odd…

群论 · 数学 2014-08-08 John R. Britnell , Neil Saunders , Tony Skyner

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

数论 · 数学 2025-08-12 Soumya Bhattacharya , Habibur Rahaman

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $12\leqslant b\leqslant 35$ and for every sufficiently large odd integer $N$, the equation…

数论 · 数学 2017-08-16 Jinjiang Li , Min Zhang

In this note, we continue an approach pursued in an earlier paper of the second author and thereby attempt to produce an improved lower bound for the sum $I(q^k) + I(n^2)$, where $q^k n^2$ is an odd perfect number with special prime $q$ and…

综合数学 · 数学 2022-09-08 Keneth Adrian Precillas Dagal , Jose Arnaldo Bebita Dris

This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be…

数论 · 数学 2007-05-23 Umesh P. Nair

A positive integer $n$ is called a tiling number if the equilateral triangle can be dissected into $nk^2$ congruent triangles for some integer $k$. An integer $n>3$ is tiling number if and only if at least one of the elliptic curves…

数论 · 数学 2024-05-21 Keqin Feng , Qiuyue Liu , Jinzhao Pan , Ye Tian

We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{\alpha_1}\cdots p_s^{\alpha_s} q_1^{\beta_1}\cdots q_t^{\beta_t}$ with $\beta_1, \ldots, \beta_t$ bounded by a given constant.…

数论 · 数学 2021-09-08 Tomohiro Yamada

Let $a,b,c$ be distinct positive integers. Set $M=a+b+c$ and $N=abc$. We give an explicit description of the Mordell-Weil group of the elliptic curve $\displaystyle E_{(M,N)}:y^2-Mxy-Ny=x^3$ over $\Q$. In particular we determine the torsion…

数论 · 数学 2015-05-08 Mohammad Sadek , Nermine El-Sissi

We study the set $\mathcal{S}$ of odd positive integers $n$ with the property ${2n}/{\sigma(n)} - 1 = 1/x$, for positive integer $x$, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that…

数论 · 数学 2021-11-29 László Tóth

We prove that every sufficiently large odd integer is a sum of two positive squares and a prime. Let R(n) be the number of representations n = x^2 + y^2 + p with x, y >= 1 and p prime. We show that R(n) > 0 for all odd n >= n0 and obtain…

综合数学 · 数学 2025-09-19 Ricardo Adonis Caraccioli Abrego

Two numbers $m$ and $n$ are considered amicable if the sum of their proper divisors, $s(n)$ and $s(m)$, satisfy $s(n) = m$ and $s(m) = n$. In 1981, Pomerance showed that the sum of the reciprocals of all such numbers, $P$, is a constant. We…

数论 · 数学 2011-01-04 Jonathan Bayless , Dominic Klyve

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…

数论 · 数学 2024-07-11 William Craig , Jan-Willem van Ittersum , Ken Ono

We prove that every positive integer $n$ which is not equal to $1$, $2$, $3$, $6$, $11$, $30$, $155$, or $247$ can be represented as a sum of a squarefree number and a prime not exceeding $\sqrt{n}$.

数论 · 数学 2023-01-31 Ognian Trifonov , Jack Dalton

The friendship paradox -- the observation that, on average, one's friends have more friends than oneself -- admits two common formulations depending on whether averaging is performed over edges or over nodes. These two definitions, the…

物理与社会 · 物理学 2026-04-22 Sang Hoon Lee

The abundancy index of a positive integer is the ratio between the sum of its divisors and itself. We generalize previous results on abundancy indices by defining a two-variable abundancy index function as…

数论 · 数学 2019-01-23 David C. Luo

Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…

数论 · 数学 2023-09-15 Joel Louwsma , Joseph Martino