Results 111 to 120 of about 580,253 (234)
Note on primitive permutation groups and a diophantine equation [PDF]
, 1980 It is shown that there are no transitive rank 3 extensions of the projective linear groups H, PSL(m,q) ⩽ H ⩽ PFL(m,q), for any prime power q and integer m ⩽ 3.
Henstridge, J.D. +3 more
core +1 more source
Solutions to some diophantine equations adapted to a computer program [PDF]
, 1993 This thesis provides a computer program for the solution of Diophantine equations. The linear Diophantine equation of the form y1c1+y2c2 + yncn = e and the non-linear Diophantine equation x2 + ym = z2n and x2-dy2 = n are considered in this paper.
Mendiola, Maria Lourdes P. +1 more
core
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 +2 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
On the Diophantine equation $\sum _{j=1}^kjF_j^p=F_n^q$ [PDF]
, 2018 summary:Let $F_n$ denote the $n^{th}$ term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation $F_1^p+2F_2^p+\cdots +kF_{k}^p=F_{n}^q$ in the positive integers $k$ and $n$, where $p$ and $q$ are given positive integers.
Soydan, Gökhan +2 more
core +1 more source
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
Using the Blankenship Algorithm to Find the General Solution of a Linear Diophantine Equation [PDF]
, 1977 This paper shows that the Blankenship algorithm, originally proposed to find the greatest common divisor of several integers and a solution of the associated linear diophantine equation, can be used to find the general solution of the equation.
Morito, Susumu, Salkin, Harvey M.
core +1 more source
Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables [PDF]
, 1995 . In this paper, we present an algorithm for solving directly linear Diophantine systems of both equations and inequations. Here directly means without adding slack variables for encoding inequalities as equalities.
Evelyne Contejean, Farid Ajili
core +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