Results 81 to 90 of about 4,013,096 (184)
On Systems of Linear Diophantine Equations [PDF]
Mathematics Magazine, 1996 Introduction Something happened to me recently I would wager has happened to many who read this note. Teaching a new topic, you cannot understand one of the proofs. Your first attempt to fill the gap fails. You look through your books for an answer. Next, you ask colleagues, go to the library, maybe even use the interlibrary loan. All in vain.
openaire +1 more source
Computing all integer solutions of a genus 1 equation [PDF]
The Elliptic Logarithm Method has been applied with great successto the problem of computing all integer solutions of equations ofdegree 3 and 4 defining elliptic curves. We extend this methodto include any equation f(u,v)=0 that defines a curve of genus
Stroeker, R.J., Tzanakis, N.
core
Finding the General Solution of a Linear Diophantine Equation [PDF]
, 1977 A new procedure for finding the general solution of a linear diophantine equation is given. As a byproduct, the algorithm finds the greatest common divisor (gcd) of a set of integers.
Morito, Susumu, Salkin, Harvey M.
core +2 more sources
Discrete Mathematics, 1975 AbstractIn this paper we present necessary and sufficient conditions for the existence of solutions to more general systems of linear diophantine equations and inequalities than have previously been considered. We do this in terms of variants and extensions of generalized inverse concepts which also permit us to give representation of the set of all ...
Abraham Charnes, Frieda Granot
openaire +3 more sources
A note on equivalent systems of linear diophantine equations [PDF]
Zeitschrift für Operations Research, 1973 Another constructive proof is presented for the fact that a system of linear equations with integer coefficients in bounded integer variables is equivalent to a single equation, which is a linear combination of the original ones. The equation is obtained in a number of steps; in each step two equations are replaced by a single one.
openaire +3 more sources
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
New Journal of PhysicsBoolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision ...
Robert Simon Fong +2 more
doaj +1 more source
An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
MathematicsBenchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range R, and these instances can be referred to as the unbounded knapsack problem with bounded coefficients (UKPB).
Yang Yang
doaj +1 more source
MathematicsThis paper presents a decentralized adaptive generalized-minimum-variance (GMV) control framework for large-scale stochastic nonlinear systems composed of interconnected multi-input multi-output (MIMO) Hammerstein subsystems with unknown time-varying ...
Slim Dhahri +6 more
doaj +1 more source
On a variant of Pillai's problem involving <i>S</i>-units and Fibonacci numbers. [PDF]
Bol Soc Mat Mex, 2022 Ziegler V.
europepmc +1 more source