因为在你们之间找到一个“公约数”确实太难。不知你以为如何?
Use Euclid's algorithm to compute the greatest common divisor of 7735 and 4185.适用欧几里德算法来计算7735和4185的最大公约数。
Seek cooperation will take care of each other's interests and concerns, the greatest common divisor of cooperation.要合作就要照顾彼此利益和关切,寻求合作最大公约数。