English
Related papers

Related papers: Triangular Numbers Multiple of Triangular Numbers …

200 papers

We consider a natural generalization of the Nagell-Ljunggren equation to the case where the qth power of an integer y, for q >= 2, has a base-b representation that consists of a length-l block of digits repeated n times, where n >= 2.…

Number Theory · Mathematics 2017-07-25 Andrew Bridy , Robert J. Lemke Oliver , Arlo Shallit , Jeffrey Shallit

Using a general $q$-series expansion, we derive some nontrivial $q$-formulas involving many infinite products. A multitude of Hecke--type series identities are derived. Some general formulas for sums of any number of squares are given. A…

Number Theory · Mathematics 2018-05-15 Zhi-Guo Liu

We consider sequences of the type $A_n=6A_{n-1}-A_{n-2}, A_0=r, A_1=s$ ($r$ and $s$ integers) and show that all sequences that solve particular cases of the Pell generalized equation are expressible as a constant times one of four…

Combinatorics · Mathematics 2007-05-23 Mario Catalani

Let $\ k$ be a natural number and $d=k^{2}\pm 4$ or $k^{2}\pm 1$. In this paper, by using continued fraction expansion of $\sqrt{d},$ we find fundamental solution of the equations $x^{2}-dy^{2}=\pm 1$ and we get all positive integer…

Number Theory · Mathematics 2013-04-26 Refik Keskin , Merve Güney

A general form of multi-channel Bethe-Salpeter equation is considered. In contradistinction to the hitherto applied approaches, our coupled system of equations leads to the simultaneous solutions for all relativistic four-point Green…

High Energy Physics - Theory · Physics 2010-02-03 J. Boguszynski , H. D. Dahmen , R. Kretschmer , L. Lukaszuk

Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of…

Combinatorics · Mathematics 2012-06-14 Vincent Pilaud , Francisco Santos

We study a generalization of Pell's equation, whose coefficients are certain algebraic integers. Let $X_0=0$ and $X_n=\sqrt{2+X_{n-1}}$ for each $n\in \mathbb{Z}_{\ge 1}$. We study the $\mathbb{Z}[X_{n-1}]$-solutions of the equation…

Number Theory · Mathematics 2022-11-28 Hyuga Yoshizaki

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

Number Theory · Mathematics 2025-07-15 Sara Moore , Jonathan P. Sorenson

Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The…

Combinatorics · Mathematics 2016-08-09 Virginia Johnson , Charles K. Cook

We study a class of elliptic problems, involving a $k$-Hessian and a very fast-growing nonlinearity, on a unit ball. We prove the existence of a radial singular solution and obtain its exact asymptotic behavior in a neighborhood of the…

Analysis of PDEs · Mathematics 2022-05-27 João Marcos do Ó , Evelina Shamarova , Esteban da Silva

Let $P$ be a finite point set in the plane. A \emph{$c$-ordinary triangle} in $P$ is a subset of $P$ consisting of three non-collinear points such that each of the three lines determined by the three points contains at most $c$ points of…

The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…

Number Theory · Mathematics 2021-04-01 László Németh

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

Number Theory · Mathematics 2017-07-20 Ivan Blanco-Chacon , Gary McGuire , Oisin Robinson

We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…

Number Theory · Mathematics 2026-02-16 Jack Anderson , Amy Woodall , Alexandru Zaharescu

We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this…

Combinatorics · Mathematics 2019-04-29 Cesar Hernandez-Velez , Gelasio Salazar , Robin Thomas

We study pairs and triples consisting of triangular numbers such that the product of any two distinct elements decreased by 1 is a perfect square. For a positive integer $n$, we establish a necessary condition for the $n$-th triangular…

Number Theory · Mathematics 2026-04-01 Marija Bliznac Trebješanin

For an integer $x$ let $t_x$ denote the triangular number $x(x+1)/2$. Following a recent work of Z. W. Sun, we show that every natural number can be written in any of the following forms with $x,y,z\in\Z$: $$x^2+3y^2+t_z, x^2+3t_y+t_z,…

Number Theory · Mathematics 2007-12-24 Song Guo , Hao Pan , Zhi-Wei Sun

A class of bivariate infinite series solutions of the elliptic and hyperbolic Kepler equations is described, adding to the handful of 1-D series that have been found throughout the centuries. This result is based on an iterative procedure…

Instrumentation and Methods for Astrophysics · Physics 2021-04-08 Daniele Tommasini

Let $\F$ be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples $\{\al-1,\al,\al+1 \}$ of consecutive non-zero squares in $\F$ and similarly for the number of triples of consecutive…

Number Theory · Mathematics 2025-08-07 Stephen D. Cohen

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy
‹ Prev 1 3 4 5 6 7 10 Next ›