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
GEOMETRIC THEOREMS, DIOPHANTINE EQUATIONS, AND ARITHMETIC FUNCTIONS [PDF]
This book contains short notes or articles, as well as studies on several topics of Geometry and Number theory. The material is divided into ve chapters: Geometric theorems; Diophantine equations; Arithmetic functions; Divisibility properties of numbers ...
Sándor, József
core +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
Three Diophantine equations concerning the polygonal numbers [PDF]
Many authors investigated the problem about the linear combination of two polygonal numbers being a perfect square, i.e., the Diophantine equation mPₖ(x)+nPₖ(y)=z², where Pₖ(x) denotes the x-th k-polygonal number and m, n are positive integers.
Yong Zhang, Mei Jiang, Qiongzhi Tang
doaj +1 more source
Solution to a pair of linear, two-variable, Diophantine equations with coprime coefficients from balancing and Lucas-balancing numbers [PDF]
Let Bₙ and Cₙ be the n-th balancing and Lucas-balancing numbers, respectively. We consider the Diophantine equations ax + by = (1/2)(a - 1)(b - 1) and 1 + ax + by = (1/2)(a - 1)(b - 1) for (a,b) ∈ {(Bₙ,Bₙ₊₁), (B₂ₙ₋₁,B₂ₙ₊₁), (Bₙ,Cₙ), (Cₙ,Cₙ₊₁)} and ...
R. K. Davala
doaj +1 more source
Small solutions of linear Diophantine equations
Given a system of linear diophantine equations and let (*) \(Ax=B\) be its matrix form, where \(A=(a_{ij})\) is a \(m\times n\), \(x=(x_k)\) and \(B=(a_{k,n+1})\) are \(m\times 1\) matrices. Further, given integers \(1\leq j_1< \cdots < j_m\leq n+1\), let \(d_{j_1,\ldots, j_m} = \det (a_{i,j_r}),\) \(1\leq i,r\leq m\), \(X=\sup \{| d_{j_1,\ldots, j_m}|:
I. Borosh, M. Flahive, B. Treybig
openaire +2 more sources

