Go backward to Examples Go up to Top Go forward to Logic Evaluator

More Notions

• Two numbers are relatively prime if their gcd is 1:

  x and y are relatively prime : <=> gcd(x, y) = 1.

• A number greater than 1 is prime if its only divisors are 1 and itself:

  x is prime : <=> x > 1 /\  (forall y: y | x => (y = 1 \/ y = x)).

• 16 and 27 are relatively prime.
• (Only) the underlined numbers are prime:

  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, ...