General Mathematics

    

New Simple Formula to Solve Diophantic Linear Equations

Authors: Zeolla Gabriel Martin

This document writes a new, very simple algorithm to solve linear diophantic equations in their particular solution, without having to solve them with the Euclid algorithm and the Bezout identity among others. The algorithm is very simple, fast and practical, we can choose any method to find the GCD and then replace it in the formula. This algorithm helps us to predict whether the result belongs to integers numbers or natural numbers.

Comments: 12 Pages.

Download: PDF

Submission history

[v1] 2021-11-16 11:42:27

Unique-IP document downloads: 195 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus