WOLFRAM

Wolfram Language & System Documentation Center
Wolfram Language Home Page »

Divisible
✖
Divisible

✖
Divisible[n,m]

yields True if n is divisible by m, and yields False if it is not.

Details

  • Divisible is typically used to test whether n is divisible by m.
  • 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.
  • Divisible[n, m] returns False unless n and m are manifestly divisible.
  • Divisible[n,m] can be entered as .
  • can be entered as \[Divides] or divides.

Examples

open allclose all

Basic Examples  (2)Summary of the most common use cases

Test whether a number is divisible by :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-e2s
Out[1]=1

The number is not divisible by :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-n7e
Out[1]=1

Scope  (6)Survey of the scope of standard use cases

Divisible works over integers:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-u0o0br
Out[1]=1

Gaussian integers:

In[4]:=4
✖
https://wolfram.com/xid/0ftvmoi-wo26j4
Out[4]=4

Rationals:

In[6]:=6
✖
https://wolfram.com/xid/0ftvmoi-trs5xm
Out[6]=6

Symbolic forms of numeric quantities:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-xlo
Out[1]=1

Numeric quantities:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-byi
Out[1]=1

Test for large integers:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-845fn4
Out[1]=1

Divisible threads elementwise over lists:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-eulagn
Out[1]=1

TraditionalForm formatting:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-zyj9ik

Applications  (8)Sample problems that can be solved with this function

Basic Applications  (3)

Highlight numbers divisible by :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-bfkjsd
Out[1]=1

Generate random numbers divisible by a given number:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-ejowp
In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-o0h98
Out[2]=2
In[3]:=3
✖
https://wolfram.com/xid/0ftvmoi-dda2jk
Out[3]=3

Visualize when one number divides another:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-q01
Out[1]=1

Number Theory  (5)

Recognize Wieferich primes, prime numbers p such that divides :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-hndplo
In[3]:=3
✖
https://wolfram.com/xid/0ftvmoi-len25z
Out[3]=3

There are only two known Wieferich primes:

In[4]:=4
✖
https://wolfram.com/xid/0ftvmoi-3y6osb
Out[4]=4

Let be all numbers of the form :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-y7zsqg

Check that the product of two numbers is still in :

In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-61uqh7
Out[2]=2

Recognize Hilbert primes, prime numbers that have no divisors in other than and themself:

In[3]:=3
✖
https://wolfram.com/xid/0ftvmoi-4pv3e7

Find the first Hilbert primes:

In[4]:=4
✖
https://wolfram.com/xid/0ftvmoi-2swwye
Out[4]=4

Find two representations of a number as the sum of two squares:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-35lz21
Out[1]=1

Find a divisor of the number by computing the GCD of and the number:

In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-bfwucp
Out[2]=2
In[3]:=3
✖
https://wolfram.com/xid/0ftvmoi-z6hca8
Out[3]=3

Find another divisor by computing the GCD of and the number:

In[4]:=4
✖
https://wolfram.com/xid/0ftvmoi-kdcv52
Out[4]=4
In[5]:=5
✖
https://wolfram.com/xid/0ftvmoi-48pcrv
Out[5]=5

An integer is divisible by if the sum of its digits is divisible by :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-k0yuga
Out[1]=1
In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-1ue49
Out[2]=2

An integer is divisible by if the alternating sum of the digits is divisible by :

In[3]:=3
✖
https://wolfram.com/xid/0ftvmoi-onjd
Out[3]=3
In[4]:=4
✖
https://wolfram.com/xid/0ftvmoi-w3uct
Out[4]=4

is divisible by , where n is an odd integer:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-gr3yza
Out[1]=1

Properties & Relations  (7)Properties of the function, and connections to other functions

If is an integer, then is divisible by :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-trltzi
Out[1]=1

If is divisible by , then the greatest common divisor GCD of them is :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-bvhal6
Out[1]=1
In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-cfk519
Out[2]=2

If and are relatively prime, then is not divisible by :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-d7b7z
Out[1]=1
In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-cm4xuh
Out[2]=2

If the prime factorization of an integer has the form , then the number of its divisors is :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-fauclh
Out[1]=1
In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-iw4rcj
Out[2]=2
In[3]:=3
✖
https://wolfram.com/xid/0ftvmoi-fuq8ma
Out[3]=3

Use Divisors to find all divisors of an integer:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-c2t67a
Out[1]=1
In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-nfm7cr
Out[2]=2

PrimeNu gives the number of distinct prime divisors:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-r6er5
Out[1]=1
In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-b1wdek
Out[2]=2

Simplify expressions:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-jgd1tt
Out[1]=1

Possible Issues  (2)Common pitfalls and unexpected behavior

With symbolic inputs, Divisible stays unevaluated:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-urh
Out[1]=1

Divisible does not automatically resolve the value:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-dkhpr
Out[1]=1
In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-lrscn6
Out[2]=2

Interactive Examples  (1)Examples with interactive outputs

Visualize when the sum of two prime numbers is divisible by a given number:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-rd0h4e
Out[1]=1

Neat Examples  (3)Surprising or curious use cases

Visualize when is divisible by primes. Each row of dots corresponds to the divisors of , which are labeled along the horizontal axis:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-eq61yv
Out[1]=1

Plot when divides the sum of three squares:

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-l9t
Out[1]=1

Plot the Ulam spiral of numbers divisible by :

In[1]:=1
✖
https://wolfram.com/xid/0ftvmoi-l5q7y3
In[2]:=2
✖
https://wolfram.com/xid/0ftvmoi-vcxncv
Out[2]=2
Wolfram Research (2007), Divisible, Wolfram Language function, https://reference.wolfram.com/language/ref/Divisible.html.
✖
Wolfram Research (2007), Divisible, Wolfram Language function, https://reference.wolfram.com/language/ref/Divisible.html.

Text

Wolfram Research (2007), Divisible, Wolfram Language function, https://reference.wolfram.com/language/ref/Divisible.html.

✖
Wolfram Research (2007), Divisible, Wolfram Language function, https://reference.wolfram.com/language/ref/Divisible.html.

CMS

Wolfram Language. 2007. "Divisible." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/Divisible.html.

✖
Wolfram Language. 2007. "Divisible." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/Divisible.html.

APA

Wolfram Language. (2007). Divisible. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/Divisible.html

✖
Wolfram Language. (2007). Divisible. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/Divisible.html

BibTeX

@misc{reference.wolfram_2025_divisible, author="Wolfram Research", title="{Divisible}", year="2007", howpublished="\url{https://reference.wolfram.com/language/ref/Divisible.html}", note=[Accessed: 04-June-2025 ]}

✖
@misc{reference.wolfram_2025_divisible, author="Wolfram Research", title="{Divisible}", year="2007", howpublished="\url{https://reference.wolfram.com/language/ref/Divisible.html}", note=[Accessed: 04-June-2025 ]}

BibLaTeX

@online{reference.wolfram_2025_divisible, organization={Wolfram Research}, title={Divisible}, year={2007}, url={https://reference.wolfram.com/language/ref/Divisible.html}, note=[Accessed: 04-June-2025 ]}

✖
@online{reference.wolfram_2025_divisible, organization={Wolfram Research}, title={Divisible}, year={2007}, url={https://reference.wolfram.com/language/ref/Divisible.html}, note=[Accessed: 04-June-2025 ]}