summary:We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality $ax \mod b\leq x$, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers
Let N \u3e 1 be an integer, and let 1 \u3c a_1 \u3c ... \u3c a_N be relatively prime integers. Frob...
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role...
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role...
Abstract: We give an algorithm to compute the greatest integer that is not solution of a Diophantine...
summary:We present an algorithm for computing the greatest integer that is not a solution of the mod...
summary:We present an algorithm for computing the greatest integer that is not a solution of the mod...
We introduce and review the Frobenius Problem, determining the greatest integer not expressible as a...
AbstractWe study the Frobenius problem: given relatively prime positive integers a1,…,ad, find the l...
In this article we formalize in Mizar [1], [2] the maximum number of steps taken by some number theo...
Given a positive integer n and a set of relatively prime positive integers a1 , ..., ak ,\ud we say ...
AbstractSuppose a, b, c are three positive integers with gcd = 1. We consider the function ƒ(a, b, c...
We give upper and lower bounds for the largest integer not representable as a positive linear combin...
AbstractLetXk={a1,a2,…,ak},k>1, be a subset of N such that gcd(Xk)=1. We shall say that a natural nu...
Let p = ( p 1 ,…, p n ) be a vector of positive integers whose greatest common divisor is unity. The...
Let p = ( p 1 ,…, p n ) be a vector of positive integers whose greatest common divisor is unity. The...
Let N \u3e 1 be an integer, and let 1 \u3c a_1 \u3c ... \u3c a_N be relatively prime integers. Frob...
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role...
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role...
Abstract: We give an algorithm to compute the greatest integer that is not solution of a Diophantine...
summary:We present an algorithm for computing the greatest integer that is not a solution of the mod...
summary:We present an algorithm for computing the greatest integer that is not a solution of the mod...
We introduce and review the Frobenius Problem, determining the greatest integer not expressible as a...
AbstractWe study the Frobenius problem: given relatively prime positive integers a1,…,ad, find the l...
In this article we formalize in Mizar [1], [2] the maximum number of steps taken by some number theo...
Given a positive integer n and a set of relatively prime positive integers a1 , ..., ak ,\ud we say ...
AbstractSuppose a, b, c are three positive integers with gcd = 1. We consider the function ƒ(a, b, c...
We give upper and lower bounds for the largest integer not representable as a positive linear combin...
AbstractLetXk={a1,a2,…,ak},k>1, be a subset of N such that gcd(Xk)=1. We shall say that a natural nu...
Let p = ( p 1 ,…, p n ) be a vector of positive integers whose greatest common divisor is unity. The...
Let p = ( p 1 ,…, p n ) be a vector of positive integers whose greatest common divisor is unity. The...
Let N \u3e 1 be an integer, and let 1 \u3c a_1 \u3c ... \u3c a_N be relatively prime integers. Frob...
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role...
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role...
DOI
Add to ORKG