Results 21 to 30 of about 268 (182)
Repdigits in the base $b$ as sums of four balancing numbers [PDF]
The sequence of balancing numbers $(B_n)$ is defined by the recurrence relation $B_n=6B_{n-1}-B_{n-2}$ for $n\geq2$ with initial conditions $B_0=0$ and $B_1=1.$ $B_n$ is called the $n$th balancing number. In this paper, we find all repdigits in the base $
Refik Keskin, Fatih Erduvan
doaj +1 more source
Matrix Diophantine equations over quadratic rings and their solutions
The method for solving the matrix Diophantine equations over quadratic rings is developed. On the basic of the standard form of matrices over quadratic rings with respect to $(z,k)$-equivalence previously established by the authors, the matrix ...
N.B. Ladzoryshyn +2 more
doaj +1 more source
Integral geometry on discrete matrices
In this note, we study the Radon transform and its dual on the discrete matrices by defining hyperplanes as being infinite sets of solutions of linear Diophantine equations. We then give an inversion formula and a support theorem.
Attioui Abdelbaki
doaj +1 more source
S-Restricted Compositions Revisited [PDF]
An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in recent years.
Behrouz Zolfaghari +2 more
doaj +1 more source
A New Algorithm Based on Colouring Arguments for Identifying Impossible Polyomino Tiling Problems
Checkerboard colouring arguments for proving that a given collection of polyominoes cannot tile a finite target region of the plane are well-known and typically applied on a case-by-case basis. In this article, we give a systematic mathematical treatment
Marcus R. Garvie, John Burkardt
doaj +1 more source
Solution of Linear and Quadratic Equations Based on Triangular Linear Diophantine Fuzzy Numbers
This paper is introducing a new concept of triangular linear Diophantine fuzzy numbers (TLDFNs) in a generic way. We first introduce the concept of TLDFNs and then study the arithmetic operations on these numbers.
Naveed Khan +4 more
doaj +1 more source
Linear systems of Diophantine equations
Given free modules $M\subseteq L$ of finite rank $f\geq 1$ over a principal ideal domain $R$, we give a procedure to construct a basis of $L$ from a basis of $M$ assuming the invariant factors or elementary divisors of $L/M$ are known. Given a matrix $A\in M_{m,n}(R)$ of rank $r$, its nullspace $L$ in $R^n$ is a free $R$-module of rank $f=n-r$.
openaire +4 more sources
Solutions of the Diophantine Equations Br=Js+Jt and Cr=Js+Jt
Let Brr≥0, Jrr≥0, and Crr≥0 be the balancing, Jacobsthal, and Lucas balancing numbers, respectively. In this paper, the diophantine equations Br=Js+Jt and Cr=Js+Jt are completely solved.
Ahmed Gaber, Mohiedeen Ahmed
doaj +1 more source
Application of the group action approach to solving linear Diophantine equations [PDF]
The article substantiates a method for solving linear Diophantine equations using the theory of group actions. The purpose of this paper is to introduce actions of certain groups on the set of linear Diophantine equations and to study their ...
Chistov, Ivan Sergeevich +1 more
doaj +1 more source
On Some Methods for Solution of Linear Diophantine Equations
The paper considers a linear Diophantine equation. A method (algorithm) for finding a general class of solutions of equation is proposed. The proposed algorithm is explained by examples of equations with two and three variables, trying to direct the ...
Azam Imomov, Yorqin T. Khodjaev
doaj +1 more source

