Results 11 to 20 of about 580,253 (234)
Linear reachability problems and minimal solutions to linear Diophantine equation systems [PDF]
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 +5 more sources
On Linear Diophantine Equation [PDF]
, 2017 {"references": ["1.\tDickson. L. E, History of the Theory of Numbers, Vol.2, Chelsea, New York, 1952. 2.\tKirch. A. M, Elementary Number Theory, In tent Educational \tpublisher, New York, 1974. 3.\tNagell. T, Introduction to Number Theory, Stockholm and New York, 1951. 4.\tOre. O, Number Theory and its History, McGraw \u2013 Hill. New York. 1948. 5.\
Dr. D. Ramprasad
openaire +3 more sources
Efficient solution of linear diophantine equations [PDF]
Journal of Symbolic Computation, 1989 The paper gives a new method for finding complete information about all nonnegative solutions of a linear homogeneous or inhomogeneous diophantine equation \[ \sum_{i=1}^{m}a_ix_i- \sum_{j=1}^{n}b_jy_j=c, \] where the \(a_i's\) and \(b_j's\) are positive integers and \(c\) is \(0\) resp. a positive integer.
Michael Clausen, Albrecht Fortenbacher
openaire +2 more sources
Solving Linear Diophantine Equations And Linear Congruential Equations [PDF]
, 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. There are many examples which illustrate the methods for solving equations.
Yesilyurt, Deniz
core +4 more sources
On the Diophantine Equation $${L^2_m}+{L^2_n}=2^a$$ [PDF]
Proceedings of the Bulgarian Academy of SciencesThis study researches numbers that are powers of two and can be represented as the sum of the squares of any two Lucas numbers. We apply Baker's theory of linear forms in logarithms of algebraic numbers, combined with a variation of the Baker--Davenport ...
Ahmet Emin
semanticscholar +2 more sources
Monoids determined by a homogenous linear diophantine equation and the half-factorial property [PDF]
, 2000 We study additive submonoids M of Nn consisting of the solutions of a homogeneous linear diophantine equation with integer coefficients. Surprisingly, not very much is known about the structure of M. M is a Krull monoid which, however, cannot be realized
S. Chapman, U. Krause, E. Oeljeklaus
semanticscholar +2 more sources
Does the Solution to the Non-linear Diophantine Equation 3x+35y=Z2 Exist?
Journal of scientific research, 2022 This paper investigates the solutions (if any) of the Diophantine equation 3x + 35y = Z2, where , x, y, and z are whole numbers. Diophantine equations are drawing the attention of researchers in diversified fields over the years.
D. Biswas
semanticscholar +1 more source
Cryptography Using Linear Diophantine Equation [PDF]
, 2022 : This study is focused on the encrypting and decrypting of messages using the Linear Diophantine Equation: where , that is the integers and are relatively prime.
Mark Kenneth C. Engcot
core +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