GCD

class proveit.numbers.GCD(a, b, *, styles=None)

Bases: proveit.Function

Methods Summary

deduce_relatively_prime(self, …)

From GCD(a,b) expression and knowledge or assumption that GCD(a,b)=1, deduce that a, b are relatively prime and return the universally-quantified claim that for all natural positive numbers p > 1 we have Not(p|a AND p|b).

Methods Documentation

deduce_relatively_prime(self, \*\*defaults_config)

From GCD(a,b) expression and knowledge or assumption that GCD(a,b)=1, deduce that a, b are relatively prime and return the universally-quantified claim that for all natural positive numbers p > 1 we have Not(p|a AND p|b).

Keyword arguments are accepted for temporarily changing any of the attributes of proveit.defaults.