中文
相关论文

相关论文: When is 0.999... equal to 1?

200 篇论文

We construct an analytic approach to evaluate odd Euler sums, multiple zeta value $\zeta(3,2,\ldots,2)$ and multiple $t$-value $t\left(3,2,\ldots,2\right)$. Moreover, we also conjecture a closed expression for multiple $t$-value…

数论 · 数学 2021-11-16 Sarth Chavan , Masato Kobayashi , Jorge Layja

In this note we associate a sequence of non-negative integers to any convergent series of positive real numbers and study this sequence for the series $\sum_{n \geq 1} n^{-k}$ where $k$ is an integer $\geq 2$.

数论 · 数学 2018-07-17 Soumyadip Sahu

The Tu--Deng Conjecture is concerned with the sum of digits $w(n)$ of $n$ in base~$2$ (the Hamming weight of the binary expansion of $n$) and states the following: assume that $k$ is a positive integer and $1\leq t<2^k-1$. Then \[\Bigl…

组合数学 · 数学 2018-07-12 Lukas Spiegelhofer , Michael Wallner

For each positive integer $m$, the $m$th order harmonic numbers are given by $$H_n^{(m)}=\sum_{0<k\le n}\frac1{k^m}\ \ (n=0,1,2,\ldots).$$ We discover exact values of some series involving harmonic numbers of order not exceeding four. For…

数论 · 数学 2025-03-04 Zhi-Wei Sun

We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.

数论 · 数学 2007-05-23 Tsz Ho Chan , Angel V. Kumchev

We consider two recent conjectures of Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index and exclusive sum number of graphs. One conjecture posits an exact relationship…

组合数学 · 数学 2023-03-22 John Haslegrave

A set of non-negative integers A is an additive 2-basis with range n, if its sumset A+A contains 0, 1, ..., n but not n+1. Explicit bases are known with arbitrarily large size |A|=k and $n/k^2 \ge 2/7 > 0.2857$. We present a more general…

数论 · 数学 2018-10-04 Jukka Kohonen

We show that there exist infinite sets $A = \{a_1,a_2,\dots\}$ and $B = \{b_1,b_2,\dots\}$ of natural numbers such that $a_i+b_j$ is prime whenever $1 \leq i < j$.

数论 · 数学 2024-01-30 Terence Tao , Tamar Ziegler

We prove there exist infinitely many odd integers $n$ for which there exists a pair of positive divisors $d_1, d_2>1$ of $(n^2+1)/2$ such that $$d_1+d_2=\delta n+(\delta+2).$$ We prove the similar result for $\varepsilon=\delta-2$ and…

数论 · 数学 2017-07-04 Sanda Bujačić Babić

Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…

数论 · 数学 2022-05-10 Fang-Yu Ma

We investigate properties of an ordinal sum of uninorms introduced in [8] in the case that the summands are proper representable uninorms. We show sufficient and necessary conditions for a uninorm to be an ordinal sum of representable…

综合数学 · 数学 2015-06-24 Andrea Mesiarova-Zemankova

A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.

组合数学 · 数学 2007-05-23 Mark van Hoeij

The balancing numbers $B_n$ ($n=0,1,\cdots$) are solutions of the binary recurrence $B_n=6B_{n-1}-B_{n-2}$ ($n\ge 2$) with $B_0=0$ and $B_1=1$. In this paper we show several relations about the sums of product of two balancing numbers of…

数论 · 数学 2021-07-19 Takao Komatsu , Gopal Krishna Panda

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

数论 · 数学 2024-01-04 Yuhui Liu

It is well-known that any sequence of at least N integers contains a subsequence whose sum is 0 (mod N). However, there can be very few subsequences with this property (e.g. if the initial sequence is just N 1's, then there is only one…

组合数学 · 数学 2007-09-11 Ernie Croot , Christian Elsholtz

The aim of this note is to provide a simple proof of some well-known identities and recurrences relating classical Bernoulli and Euler numbers by using the Abel sum of the divergent series $\sum_{n=0}^\infty (-1)^{n} (n+1)^k$, $k$ a…

经典分析与常微分方程 · 数学 2019-03-25 Sergio A. Carrillo

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

数论 · 数学 2008-10-06 Joseph B. Keller

We describe a computation that confirms the ternary Goldbach Conjecture up to 8,875,694,145,621,773,516,800,000,000,000 (>8.875e30).

数论 · 数学 2014-04-02 H. A. Helfgott , David J. Platt

Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.

组合数学 · 数学 2017-03-02 Andrei K. Svinin

For two odd primes $p$ and $q$ such that $p<q$, let $A(p,q):=(a_k)_{k=1}^{\infty}$ be the arithmetic progression whose $k$th term is given by $a_k=(k-1)(q-p)+p$ (i.e., with $a_1=p$ and $a_2=q$). Here we conjecture that for every positive…

数论 · 数学 2019-01-24 Romeo Meštrović