answersLogoWhite

0

The same as the GCF of 801 and 534, where 534 is the remainder of the division of 2136 by 801. You can continue this process of division, until you get one number that is a multiple of the other. When that happens, the smaller number is the GCF of the original numbers. (For more details: this method is known as Euclid's Algorithm.)

User Avatar

Wiki User

12y ago

What else can I help you with?