中文
相关论文

相关论文: Partitions with prescribed sum of reciprocals: asy…

200 篇论文

For a positive rational $\alpha$, call a set of distinct positive integers $\{a_1, a_2, \ldots, a_r\}$ an $\alpha$-partition of $n$, if the sum of the $a_i$ is equal to $n$ and the sum of the reciprocals of the $a_i$ is equal to $\alpha$.…

数论 · 数学 2025-07-25 Wouter van Doorn

In 1963, Graham proved that all integers greater than 77 (but not 77 itself) can be partitioned into distinct positive integers whose reciprocals sum to 1. He further conjectured that for any sufficiently large integer, it can be…

数论 · 数学 2025-02-11 Max A. Alekseyev

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

数论 · 数学 2019-09-11 Yuchen Ding , Yu-Chen Sun

In this paper, we prove the following result: {quote} Let $\A$ be an infinite set of positive integers. For all positive integer $n$, let $\tau_n$ denote the smallest element of $\A$ which does not divide $n$. Then we have $$\lim_{N \to +…

数论 · 数学 2009-12-15 Bakir Farhi

For fixed positive reals $t$ and $\alpha$, consider the sequence $S_t(\alpha) = (s_1, s_2, \ldots, )$ with $s_n = \left \lfloor t\alpha^n \right \rfloor$. In 1964, Graham managed to characterize those pairs $(t, \alpha)$ with $0 < t < 1$…

数论 · 数学 2026-03-02 Wouter van Doorn

We show that sequences of positive integers whose ratios $a_n^2/a_{n+1}$ lie within a specific range are almost uniquely determined by their reciprocal sums. For instance, the Sylvester sequence is uniquely characterized as the only…

数论 · 数学 2025-04-09 Junnosuke Koizumi

Answering a question of Erd\H{o}s and Graham, we show that for each fixed positive rational number $x$ the number of ways to write $x$ as a sum of reciprocals of distinct positive integers each at most $n$ is $2^{(c_x + o(1))n}$ for an…

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 consider two multiplicative statistics on the set of integer partitions: the norm of a partition, which is the product of its parts, and the supernorm of a partition, which is the product of the prime numbers $p_i$ indexed by its parts…

组合数学 · 数学 2023-08-30 Jeffrey C. Lagarias , Chenyang Sun

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

组合数学 · 数学 2012-07-16 Noga Alon

In this paper we strongly improve asymptotics for $s_1(n)$ (respectively $s_2(n)$) which sums reciprocals (respectively squares of reciprocals) of parts throughout all the partitions of $n$ into distinct parts. The methods required are much…

数论 · 数学 2024-12-04 Kathrin Bringmann , Byungchan Kim , Eunmi Kim

Let $\boldsymbol{\alpha}\in \mathbb{R}^N$ and $Q\geq 1$. We consider the sum $\sum_{\boldsymbol{q}\in [-Q,Q]^N\cap\mathbb{Z}^N\backslash\{\boldsymbol{0}\}}\|\boldsymbol{\alpha}\cdot\boldsymbol{q}\|^{-1}$. Sharp upper bounds are known when…

数论 · 数学 2018-05-03 Reynold Fregoli

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

数论 · 数学 2023-11-28 Sai Teja Somu , Andrzej Kukla , Duc Van Khanh Tran

Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…

组合数学 · 数学 2017-11-09 Lisa Hui Sun , Mingzhi Zhang

We obtain results bounding the degree of the series $\sum_{n=1}^{\infty} 1/\alpha_n$, where $\{\alpha_n\}$ is a sequence of algebraic integers satisfying certain algebraic conditions and growth conditions. Our results extend results of…

数论 · 数学 2018-12-19 Simon Bruno Andersen , Simon Kristensen

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

组合数学 · 数学 2023-11-17 Adrian Beker

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

数论 · 数学 2023-01-09 Ernie Croot , Hamed Mousavi , Maxie Schmidt

Let $\alpha=\{a_1,a_2,a_3,...,a_n\}$ be a set of elements, $\delta < n$ be a non-negative integer, and $\Gamma: \alpha \to \{0, 1, 2, ..., n\}$ be a total mapping. Then, we call $\Gamma$ a \emph{partition} of $\alpha$ if and only if for all…

数据结构与算法 · 计算机科学 2021-02-04 Samer Nofal

We prove that the sum of reciprocals $1/x$ of integer solutions of $(x^m-1)/(x-1)=N$ with $x, m\geq 2$ for a given integer $N$ except the smallest $x$ is smaller than $5.9037$. If we limit $x$ to be prime, then the sum is smaller than…

数论 · 数学 2025-10-14 Tomohiro Yamada

A positive integer $n$ is said to be a palindrome in base $b$ (or $b$-adic palindrome) if the representation of $n = (a_k a_{k-1} \cdots a_0)_b$ in base $b$ with $a_k \neq 0$ has the symmetric property $a_{k-i} = a_i$ for every…

经典分析与常微分方程 · 数学 2018-03-06 Phakhinkon Phunphayap , Prapanpong Pongsriiam
‹ 上一页 1 2 3 10 下一页 ›