![]() ![]() And after step 1, all remaining prime factors must be odd (difference of two prime factors must be at least 2), this explains why i is incremented by 2. This is clear that step 1 takes care of even numbers. To prove that the complete algorithm works, we need to prove that steps 1 and 2 actually take care of composite numbers. The steps 1 and 2 take care of composite numbers and step 3 takes care of prime numbers. GCD of more than two (or array) numbers.Finding LCM of more than two (or array) numbers without using GCD.Program to find GCD or HCF of two numbers. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |