中文
相关论文

相关论文: On partitions of integers with restrictions involv…

200 篇论文

In this paper, using a basic algebraic approach, we demonstrate that, if the integers $x,y$ and $z$ are pairwise relatively prime, and $x^p-my^p=zw$ where $m$ is an integer and $p$ is a prime, then we can write $x,y,m,z$ and $w$ as explicit…

代数几何 · 数学 2020-05-01 Antenor Ostine

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is a multiple of 4.

数论 · 数学 2009-03-27 Kent D. Boklan , Noam D. Elkies

We study triples {a,b,c} of distinct nonzero rational numbers such that a+1,b+1,c+1,ab+1,ac+1,bc+1 and abc+1 are all perfect squares. We prove that there exist infinitely many such triples. In contrast, we show that no triple of positive…

数论 · 数学 2026-04-13 Andrej Dujella , Matija Kazalicki , Vinko Petričević

In this paper, we study the number of representations of a positive integer $n$ by two positive integers whose product is a multiple of a polygonal number.

数论 · 数学 2017-09-20 Hao Zhong , Tianxin Cai

We prove a conjecture posted in the Online Encyclopedia of Integer Sequences, namely that there are exactly five positive integers that can be written in more than one way as the sum of a nonnegative power of 2 and a nonnegative power of 3.…

数论 · 数学 2019-07-11 Douglas Edward Iannucci

We discuss the problem of finding distinct integer sets $\{x_1,x_2,...,x_n\}$ where each sum $x_i+x_j, i \ne j$ is a square, and $n \le 7$. We confirm minimal results of Lagrange and Nicolas for $n=5$ and for the related problem with…

数论 · 数学 2009-09-10 Allan J. MacLeod

For any positive integers l and m, a set of integers is said to be (weakly) l-sum-free modulo m if it contains no (pairwise distinct) elements $x_1,x_2,...,x_l,y$ satisfying the congruence $x_1+\...+x_l\equiv y\bmod{m}$. It is proved that,…

In this paper, we give a specific way of describing positive integer solutions of a Diophantine equation $(x+y)^2+(y+z)^2+(z+x)^2=12xyz$ and introduce a generalized cluster pattern behind it.

数论 · 数学 2022-09-20 Yasuaki Gyoda

The numbers of representations of totally positive integers as sums of three integer squares in $\mathbf{Q}(\sqrt{3})$ and in $\mathbf{Q}(\sqrt{17})$, are studied by using Shimura lifting map of Hilbert modular forms. We show the following…

数论 · 数学 2020-04-21 Shigeaki Tsuyumine

We investigate the frequency of positive squareful numbers x,y,z for which x+y=z.

数论 · 数学 2011-06-23 T. D. Browning , K. Van Valckenborgh

We use sums of Liouville type to count the number of ways a positive integer can be represented by the forms $(a+c)^{1/3}x + (b+d)y$, $(a+c)x + \bigl(k(b+d) \bigr)^{1/3} y$, and $\bigl(k(a+c) \bigr)^{1/3} x + l(b+d) y$ for nonnegative…

数论 · 数学 2014-03-11 Mohamed El Bachraoui

Let $n$ be a squarefree positive odd integer. We will show that there exist infinitely many imaginary quadratic number fields with discriminant divisible by $n$ and-at the same time-having an element of order $n$ in the class group. We then…

数论 · 数学 2021-08-17 Meng Fai Lim

We consider words $w$ over the alphabet $\Sigma=\{0,1,2\}$. It is shown that there are irreducibly square-free words of all lengths $n$ except 4,5,7 and 12. Such a word is square-free (i.e., it has no repetitions $uu$ as factors), but by…

组合数学 · 数学 2020-07-06 Tero Harju

Given a positive integer $n$, we let ${\rm sfp}(n)$ denote the squarefree part of $n$. We determine all positive integers $n$ for which $\max \{ {\rm sfp}(n), {\rm sfp}(n+1), {\rm sfp}(n+2) \} \leq 150$ by relating the problem to finding…

数论 · 数学 2018-01-22 Jeremy Rouse , Yilin Yang

Let $f$ be a multiplicative function which satisfies \[ f(a^2+b^2+c^2+d^2) = f(a^2+b^2)+f(c^2+d^2) \] for positive integers $a$, $b$, $c$, and $d$. We show that $f$ is the identity function provided that $f(3)\,f(11) \ne 0$. Otherwise,…

数论 · 数学 2019-03-26 Poo-Sung Park

It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…

数论 · 数学 2018-11-13 Christian Woll

In 1957 N.C. Ankeny provided a new proof of the three squares theorem using geometry of numbers. This paper generalizes Ankeny's technique, proving exactly which integers are represented by $x^2 + 2y^2 + 2z^2$ and $x^2 + y^2 + 2z^2$ as well…

数论 · 数学 2015-09-10 Gabriel Durham

Let $d>r\ge 0$ be integers. For positive integers $a,b,c$, if any term of the arithmetic progression $\{r+dn:\ n=0,1,2,\ldots\}$ can be written as $ax^2+by^2+cz^2$ with $x,y,z\in\mathbb{Z}$, then the form $ax^2+by^2+cz^2$ is called…

数论 · 数学 2024-01-12 Hai-Liang Wu , Zhi-Wei Sun

Let $a$ and $m>0$ be integers. We show that for any integer $b$ relatively prime to $m$, the set $\{a^n+bn:\ n=1,\ldots,m^2\}$ contains a complete system of residues modulo $m$. We also pose several conjectures for further research; for…

数论 · 数学 2014-02-28 Zhi-Wei Sun

Let $m\ge3$ be an integer. The polygonal numbers of order $m+2$ are given by $p_{m+2}(n)=m\binom n2+n$ $(n=0,1,2,\ldots)$. A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of $m+2$ polygonal numbers…

数论 · 数学 2017-10-06 Xiang-Zi Meng , Zhi-Wei Sun