How can we solve a linear Diophantine equation by the basis reduction algorithm

By Esmaeili H.  

International Journal of Computer Mathematics, Vol. 82, Iss. 10, 2005-10 ,pp. : 1227-1234

Taylor & Francis Ltd

Access to resources Recommend Favorite

The Euclidean Algorithm and the Linear Diophantine Equation ax + by = gcd( a , b )

By Rankin S.A.  

American Mathematical Monthly, Vol. 120, Iss. 6, 2013-06 ,pp. : 562-564

Mathematical Association of America

Access to resources Recommend Favorite

On the number of solutions of the Diophantine equation

By Sándor Csaba  

Periodica Mathematica Hungarica, Vol. 47, Iss. 1-2, 2003-01 ,pp. : 215-219

Springer Publishing Company

Access to resources Recommend Favorite

On the Solution of Linear Mean Recurrences

By Borwein David   Borwein Jonathan M.   Sims Brailey  

American Mathematical Monthly, Vol. 121, Iss. 6, 2014-06 ,pp. : 486-498

Mathematical Association of America

Access to resources Recommend Favorite

On solving linear recurrences

By Dobbs David E.  

International Journal of Mathematical Education in Science and Technology, Vol. 44, Iss. 2, 2013-03 ,pp. : 310-315

Taylor & Francis Ltd

Access to resources Recommend Favorite