User talk:15071A05N7

1.EUCLIDS ALGORITHM
>If A=0 then GCD (A,B)=B, and we can stop. ->If B=0 then GCD (A,B)=A,and we can stop. ->write A in quotient remainder form A=B.Q             +R. ->Find GCD (B, R) using the Euclid algorithm since GCD (A, B) =GCD (B,R) 15071A05N7 (talk) 13:56, 27 December 2016 (UTC)

Welcome student
Hello, 15071A05N7 and welcome to Wikipedia! It appears you are participating in a class project. If you haven't done so already, we encourage you to go through our training for students.

If you need help, check out Questions, ask me on, or ask your question on this page and then place  before the question. Please also read this helpful advice for students.

Before you create an article, make sure you understand what kind of articles are accepted here. Remember: Wikipedia is an encyclopedia, and while many topics are encyclopedic, some things are not.

Your instructor or professor may wish to set up a course page, and if your class doesn't already have one please tell your instructor about that. It is highly recommended that you place this text:  on the talk page of any articles you are working on as part of your Wikipedia-related course assignment. This will let other editors know this article is a subject of an educational assignment and aid your communication with them.

We hope you like it here and encourage you to stay even after your assignment is finished! —C.Fred (talk) 16:55, 27 December 2016 (UTC)