• ← CompositeQ
• → GCD

Divisible

WMA link

Divisible[n, m]

returns True if n is divisible by m, and False otherwise.

• n is divisible by m if n is the product of m by an integer.
  
• Divisible[n,m] is effectively equivalent to Mod[n,m]==0.

  Test whether the number 10 is divisible by 2

  • • Divisible[10, 2]

  But the other way around is False: 2 is not divisible by 10:

  • • Divisible[2, 10]

  ← CompositeQ

  → GCD