Results 11 to 20 of about 565 (158)
Efficient solution of linear diophantine equations
Journal of Symbolic Computation, 1989 This paper presents a new method for finding complete information about the set of all nonnegative integer solutions of homogeneous and inhomogeneous linear diophantine equations.
Fortenbacher, Albrecht, Clausen, Michael
core +2 more sources
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Theoretical Computer Science, 2004 The linear reachability problem for finite state transition systems is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint.
Zhe Dang
exaly +3 more sources
Solving Linear Diophantine Equations And Linear Congruential Equations
, 2012 This report represents GCD, euclidean algorithm, linear diophantine equation and linear congruential equation. It investigates the methods for solving linear diophantine equations and linear congruential equations in several variables.
Yesilyurt, Deniz
core +3 more sources
The mathematical analysis of Linear Diophantine equations with two and three variables and Its Applications [PDF]
The Egyptian International Journal of Engineering Sciences and Technology, 2023 Linear Diophantine equation are introduced to determine and search for integral solutions according to the associated variables. In this paper, the mathematical techniques are approached to solve Linear Diophantine equation with two, three unknowns and ...
Rania Amer
doaj +1 more source
, 2009 Two necessary and sufficient conditions are presented for Hamiltonian cycle problem in simple undirected graph using linear Diophantine equation systems with cycle vector. The first one is based on the incidence matrix and the second one is based on edge-
Guohun Zhu, Chunwei Song
exaly +2 more sources
An Introduction to Refined Neutrosophic Number Theory [PDF]
Neutrosophic Sets and Systems, 2021 Number theory is concerned with properties of integers and Diophantine equations. The objective of this paper is dedicated to introduce the basic concepts in refined neutrosophic number theory such as division, divisors, congruencies, and Pell's equation
Mohammad Abobala, Muritala Ibrahim
doaj +1 more source
Neutrosophic Linear Diophantine Equations with Two Variables [PDF]
Neutrosophic Sets and Systems, 2020 This paper studies for the first time the neutrosophic linear Diophantine equations with two variables in the neutrosophic ring of integers, and refined neutrosophic ring of integers.
Hasan Sankari, Mohammad Abobala
doaj +1 more source
Lucas sequences and repdigits [PDF]
Mathematica Bohemica, 2022 Let $(G_n)_{n \geq1}$ be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are $\{U_n\}$ and $\{V_n\}$, respectively.
Hayder Raheem Hashim, Szabolcs Tengely
doaj +1 more source
Sparse Solutions of Linear Diophantine Equations [PDF]
SIAM Journal on Applied Algebra and Geometry, 2017 We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\boldsymbol b}$, ${\boldsymbol y} \in \mathbb Z^t_{\ge 0}$ with the smallest number of non-zero entries. Our tools are algebraic and number theoretic in nature and include Siegel's Lemma, generating functions, and commutative algebra.
Iskander Aliev +3 more
openaire +5 more sources
Linear Diophantine equations in several variables [PDF]
Linear Algebra and its Applications, 2022 Let $R$ be a ring and let $(a_1,\dots,a_n)\in R^n$ be a unimodular vector, where $n\geq 2$ and each $a_i$ is in the center of $R$. Consider the linear equation $a_1X_1+\cdots+a_nX_n=0$, with solution set $S$. Then $S=S_1+\cdots+S_n$, where each $S_i$ is naturally derived from $(a_1,\dots,a_n)$, and we give a presentation of $S$ in terms of generators ...
Quinlan, R., Shau, M., Szechtman, F.
openaire +3 more sources