Related papers: Generalized Pell-Fermat equations and Pascal trian…

For all positive non-square integer multiplier k, there is an infinity of multiples of triangular numbers which are also triangular numbers. With a simple change of variables, these triangular numbers can be found using solutions of Pell…

In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the…

We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…

For an integer $k \geq 2$, let $\{ P_{n}^{(k)} \}_{n}$ be the $k$-generalized Pell sequence which starts with $0, \dots,0,1$($k$ terms) and each term afterwards is the sum of $k$ preceding terms. In this paper, we find all the solutions of…

Ramanujan sums have attracted significant attention in both mathematical and engineering disciplines due to their diverse applications. In this paper, we introduce an algebraic generalization of Ramanujan sums, derived through polynomial…

The polynomial Ramanujan sum was first introduced by Carlitz [7], and a generalized version by Cohen [10]. In this paper, we study the arithmetical and analytic properties of these sums, derive various fundamental identities, such as H…

In this paper, we begin by introducing a well-known geometry concept: the Fermat point in a triangle. Then, we generalize the problem and propose an iterative algorithm based on gradient descent to the weighted form in Lp space. We also…

All integer solutions $\left(M,a,c\right)$ to the problem of the sums of $M$ consecutive cubed integers $\left(a+i\right)^{3}$ ($a>1$, $0\leq i\leq M-1$) equaling squared integers $c^{2}$ are found by decomposing the product of the…

A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a…

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…

In this paper, after presenting the results of the generalization of Pascal triangle (using powers of base numbers), we examine some properties of the 112-based triangle, most of all regarding to prime numbers. Additionally, an effective…

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$…

In this paper, we explain a new Iterative Method-Fixed Point and develop its convergence theory for finding approximate solutions of nonlinear equations in the setting of Banach spaces. First, we discuss the convergence analysis of our…

Ramanujan derived the well known divergent-sum of integers in more than one way. We generalise the informal method to higher powers of the Riemann zeta function through a study of the Eulerian numbers in particular. Within the context of…

We consider the generalized Lebesgue-Ramanujan-Nagell equation $x^2+17^k41^\ell 59^m=2^\delta y^n$ in the unknown integers $x\geq 1, y>1,n\geq 3$ and $k, \ell, m\geq 0$ satisfying $\gcd(x,y)=1$. We first find all the integer solutions of…

Generalized $m$-gonal numbers are those $p_m(x)= [ (m - 2)x^2 - (m - 4)x ]/2 $ where $x$ and $m$ are integers with $m \geq 3$. If any nonnegative integer can be written in the form $ap_r(h)+bp_s(l)+cp_t(m)+dp_u(n)$, where $a,b,c,d$ are…

Expander graphs in general, and Ramanujan graphs in particular, have been of great interest in the last three decades with many applications in computer science, combinatorics and even pure mathematics. In these notes we describe various…

This paper presents a universal numerical scheme tailored for tackling linear integral, integro-differential, and both initial and boundary value problems of ordinary differential equations. The numerical scheme is readily adapted for…

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…

A generalization of the well-known Fibonacci sequence is the $k$-Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,0, \ldots, 1$, and each term afterwards is the sum of the preceding $k$ terms.…