中文
相关论文

相关论文: Waring's Theorem for Binary Powers

200 篇论文

In 1960, Sierpi\'nski proved that there exist infinitely many odd positive integers $k$ such that $k\cdot 2^n+1$ is composite for all positive integers $n$. In this paper, we prove some generalizations of Sierpi\'nski's theorem with $2^n$…

数论 · 数学 2011-06-13 Lenny Jones

It is shown that the set of decimal palindromes is an additive basis for the natural numbers. Specifically, we prove that every natural number can be expressed as the sum of forty-nine (possibly zero) decimal palindromes.

数论 · 数学 2015-08-20 William D. Banks

The famous strongly binary Goldbach's conjecture asserts that every even number $2n \geq 8$ can always be expressible as the sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we…

群论 · 数学 2019-02-05 Liguo He , Xianyu Hu

In this article, we study the representability of integers as sums of pentagonal numbers, where a pentagonal number is an integer of the form $P_5(x)=\frac{3x^2-x}{2}$ for some non-negative integer $x$. In particular, we prove the…

数论 · 数学 2020-11-02 Jangwon Ju , Daejun Kim

Let $B(m, n)$ be the number of ways to colour a $2m \times 2n$ grid in black and white so that, in each row and each column, half of the cells are white and half are black. Bhattacharya conjectured that the exponent of $2$ in the prime…

组合数学 · 数学 2025-05-01 Nikolai Beluhov

Let $N(n,r,k)$ denote the number of binary words of length $n$ that begin with $0$ and contain exactly $k$ runs (i.e., maximal subwords of identical consecutive symbols) of length $r$. We show that the generating function for the sequence…

组合数学 · 数学 2017-07-17 James J. Madden

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

综合数学 · 数学 2026-01-23 Edwige Tolla

We reconsider the classical problem of representing a finite number of forms of degree d in n+1 variables as sums of powers of linear forms. We define a geometric construct called a `grove', which, in a number of cases allows us to…

代数几何 · 数学 2007-05-23 Enrico Carlini , Jaydeep Chipalkatti

For $D$ a natural number that is not a perfect square and for $k$ a non-zero integer, consider the subset $\mathbb{Z}_k(\sqrt{D})$ of the quadratic integer ring $\mathbb{Z}(\sqrt{D})$ consisting of elements $x+y\sqrt{D}$ for which $x^2 -…

数论 · 数学 2024-02-19 Christine Patterson , Marion Scheepers

We find an asymptotic formula for the number of pairs of positive integers $x_1, x_2 \le H$ such that the product $x_1 x_2$ is a $k$-th power.

数论 · 数学 2010-01-05 Doychin Tolev

Suppose $f(x,y)$ is a binary form of degree $d$ with coefficients in a field $K \subseteq \mathbb C$. The $K$-rank of $f$ is the smallest number of $d$-th powers of linear forms over $K$ of which $f$ is a $K$-linear combination. We prove…

代数几何 · 数学 2016-08-31 Bruce Reznick , Neriman Tokcan

A hyperbinary expansion of a positive integer n is a partition of n into powers of 2 in which each part appears at most twice. In this paper, we consider a generalization of this concept and a certain statistic on the corresponding set of…

组合数学 · 数学 2015-03-16 Toufik Mansour , Mark Shattuck

For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…

数论 · 数学 2020-07-21 Hai-Liang Wu

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…

数论 · 数学 2008-03-19 D. A. Goldston , S. W. Graham , J. Pintz , C. Y. Yildirim

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

A sum where each of the $N$ summands can be independently chosen from two choices yields $2^N$ possible summation outcomes. There is an $\mathcal{O}(K^2)$-algorithm that finds the $K$ smallest/largest of these sums by evading the…

数据结构与算法 · 计算机科学 2017-04-20 Torsten Gross , Nils Blüthgen

The purpose of this paper is to introduce the concept of reflecting numbers to the realm of number theory and to classify reflecting numbers of certain types. For us, reflecting numbers are coming from congruent numbers, above congruent…

数论 · 数学 2022-07-07 Ya-Qing Hu

For $k=1,2,\ldots$ let $H_k$ denote the harmonic number $\sum_{j=1}^k 1/j$. In this paper we establish some new congruences involving harmonic numbers. For example, we show that for any prime $p>3$ we have…

数论 · 数学 2013-10-31 Zhi-Wei Sun , Li-Lu Zhao

We analyze the problem of determining Waring decompositions of the powers of any quadratic form over the field of complex numbers. Our main goal is to provide information about their rank and also to obtain decompositions whose size is as…

代数几何 · 数学 2025-04-22 Cosimo Flavi

For a pair of positive integers $n,k$ with $n\geq 2$, in this paper we prove that $$ \sum_{r=1}^k\sum_{|\bf\alpha|=k}{k\choose\bf\alpha} \zeta(n\bf\alpha)=\zeta(n)^k =\sum^k_{r=1}\sum_{|\bf\alpha|=k}…

数论 · 数学 2017-06-15 Kwang-Wu Chen
‹ 上一页 1 8 9 10 下一页 ›