中文
相关论文

相关论文: A Unique Perfect Power Decagonal Number

200 篇论文

Diophantine problems involving recurrence sequences have a long history and is an actively studied topic within number theory. In this paper, we connect to the field by considering the equation \begin{align*} B_mB_{m+d}\dots…

数论 · 数学 2016-07-27 Lajos Hajdu , Shanta Laishram , Márton Szikszai

Generalized octagonal numbers are those $p_8(x)=x(3x-2)$ with $x\in\mathbb Z$. In this paper we mainly show that every positive integer can be written as the sum of four generalized octagonal numbers one of which is odd. This result is…

数论 · 数学 2015-12-18 Zhi-Wei Sun

Let $S$ denote a set of primes and let $a_1,\ldots,a_m$ be positive distinct integers. We call the $m$-tuple $(a_1,\ldots,a_m)$ an $S$-Diophantine tuple if $a_ia_j+1=s_{i,j}$ are $S$-integers for all $i\not=j$. In this paper, we show that…

数论 · 数学 2014-07-28 László Szalay , Volker Ziegler

An odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$. Similarly, an even perfect number $M$ is said to be given in Euclidean form if $M…

数论 · 数学 2017-08-28 Jose Arnaldo B. Dris

Some new results concerning the equation $\sigma(N)=aM, \sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.

数论 · 数学 2020-10-21 Tomohiro Yamada

Using completely elementary methods, we find all powers of 3 that can be written as the sum of at most twenty-two distinct powers of 2, as well as all powers of 2 that can be written as the sum of at most twenty-five distinct powers of 3.…

数论 · 数学 2023-07-04 Vassil S. Dimitrov , Everett W. Howe

In 2013 Zhi-Wei Sun conjectured that $p(n)$ is never a power of an integer when $n>1.$ We confirm this claim in many cases. We also observe that integral powers appear to repel the partition numbers. If $k>1$ and $\Delta_k(n)$ is the…

组合数学 · 数学 2025-01-10 Mircea Merca , Ken Ono , Wei-Lun Tsai

For a positive integer $n$, the set of all integers greater than or equal to $n$ is denoted by $\mathcal T(n)$. A sum of generalized $m$-gonal numbers $g$ is called tight $\mathcal T(n)$-universal if the set of all nonzero integers…

数论 · 数学 2022-02-21 Jangwon Ju , Mingyu Kim

We consider the set $$\mathcal{A} = \left\{10\cdot a + 11\cdot b \ | \gcd(a,b)=1, a\geq 1, b\geq 2a+1 \right\}.$$ We will prove that $\mathcal{A}$ is unbounded and that there exists a natural number $M\notin \mathcal{A}$ for which…

综合数学 · 数学 2021-08-05 Antonio Linero-Bas , Daniel Nieves-Roldán

Square roots $s$ of sums of $M$ consecutive integer squares starting from $a^{2}\geq1$ are integers if $M\equiv0,9,24$ or $33(mod\,72)$; or $M\equiv1,2$ or $16(mod\,24)$; or $M\equiv11(mod\,12)$ and cannot be integers if $M\equiv3,5,6,7,8$…

数论 · 数学 2014-09-30 Vladimir Pletser

Using only elementary arguments, Cassels and Uchiyama (independently) determined all squares that are sums of three consecutive cubes. Zhongfeng Zhang extended this result and determined all perfect powers that are sums of three consecutive…

数论 · 数学 2017-11-20 Alejandro Argáez-García , Vandita Patel

In this article, we find bases for the spaces of modular forms $M_{3}(\Gamma _{0}(40),\left( \frac{d}{\cdot }\right) )$ for $d=-4,-8,-20\text{ and }-40.$ We then derive formulas for the number of representations of a positive integer by all…

数论 · 数学 2022-07-13 Bülent Köklüce

We revisit Euler's partition function recurrence, which asserts, for integers $n\geq 1,$ that $$ p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+\dots = \sum_{k\in \mathbb{Z}\setminus \{0\}} (-1)^{k+1} p(n-\omega(k)), $$ where $\omega(m):=(3m^2+m)/2$ is…

数论 · 数学 2025-04-22 Kevin Gomez , Ken Ono , Hasan Saad , Ajit Singh

The starting point of our paper is Kashihara's open problem number $30$, concerning the sequence $A001292$ of the OEIS, asking how many terms are powers of integers. We confirm his last conjecture up to the $100128$-th term and provide a…

综合数学 · 数学 2024-01-29 Marco Ripà

The Euler's form of odd perfect numbers, if any, is $n=\pi^{\alpha}N^2$, where $\pi$ is prime, $(\pi,N)=1$ and $\pi\equiv \alpha \equiv 1 \pmod{4}$. Dris conjecture states that $N>\pi^{\alpha}$. We find that $N^2>\frac{1}{2}\pi^{\gamma}$,…

数论 · 数学 2017-06-08 Paolo Starni

Euler noted the relation $6^3=3^3+4^3+5^3$ and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and…

数论 · 数学 2019-02-20 Michael Bennett , Vandita Patel , Samir Siksek

The object of this paper is to give a new proof of all the solutions of the Diophantine equation x^2+11^m=y^n; in positive integers x, y with odd m>1 and n>=3.

数论 · 数学 2011-12-30 Gokhan Soydan , Musa Demirci , Ismail Naci Cangul

In this paper, we show that for a fixed rank $n$, there are only finitely many $m$ for which there is a regular $m$-gonal form of rank $n$ and determine every type of the (generalized) regular $m$-gonal form for every sufficiently large…

数论 · 数学 2020-11-06 Byeong Moon Kim , Dayoon Park

I discuss a variety of results involving s(n), the number of representations of n as a sum of three squares. One of my objectives is to reveal numerous interesting connections between the properties of this function and certain modular…

数论 · 数学 2012-07-05 Alexander Berkovich

We consider simultaneous Waring decompositions: Given forms $ f_d $ of degrees $ kd $, $ (d = 2,3 )$, which admit a representation as $ d $-th power sums of $ k $-forms $ q_1,\ldots,q_m $, when is it possible to reconstruct the addends $…

代数几何 · 数学 2023-05-12 Alexander Taveira Blomenhofer