Results 11 to 20 of about 4,479,316 (202)
On Using Linear Diophantine Equations for in-Parallel Hiding of Decision Tree Rules [PDF]
Entropy, 2019 Data sharing among organizations has become an increasingly common procedure in several areas such as advertising, marketing, electronic commerce, banking, and insurance sectors.
Georgios Feretzakis +2 more
doaj +2 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 +2 more sources
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations [PDF]
Formal Methods in System Design, 2008 Abstract: "The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interpolants in rational and real linear arithmetic. We focus on subsets of integer linear arithmetic.
Himanshu Jain +2 more
openaire +5 more sources
Efficient solution of linear diophantine equations
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
, 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 Number of Nonnegative Solutions to the Inequality a1 +....ar < n [PDF]
, 2010 In this paper, we present a simple and fast method for counting the number of nonnegative integer solutions to the equality a1x1+a2x2+: : :+arxr = n where a1; a2; :::; ar and n are positive integers.
Farzaneh , A. +3 more
core +6 more sources
Integral zeroes of Krawtchouk polynomials [PDF]
, 2012 This thesis was submitted for the degree of Master of Philosophy and awarded by Brunel University.Krawtchouk polynomials appear in many various areas of mathematics starting from discrete mathematics (e.g., in coding theory), association schemes, and in ...
Alenezi, Ahmad M
core +7 more sources
Matrix Diophantine equations over quadratic rings and their solutions
Karpatsʹkì Matematičnì Publìkacìï, 2020 The method for solving the matrix Diophantine equations over quadratic rings is developed. On the basic of the standard form of matrices over quadratic rings with respect to $(z,k)$-equivalence previously established by the authors, the matrix ...
N.B. Ladzoryshyn +2 more
doaj +1 more source
Integral geometry on discrete matrices
Moroccan Journal of Pure and Applied Analysis, 2021 In this note, we study the Radon transform and its dual on the discrete matrices by defining hyperplanes as being infinite sets of solutions of linear Diophantine equations. We then give an inversion formula and a support theorem.
Attioui Abdelbaki
doaj +1 more source
S-Restricted Compositions Revisited [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in recent years.
Behrouz Zolfaghari +2 more
doaj +1 more source