Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Divisibility"

(→‎Divisibility Video)
(I want to overhaul this stub into a ginormous handout on divisibility.)
Line 1: Line 1:
−
'''Divisibility''' is the ability of a number to be evenly divided by another number. For example, four divided by two is equal to two, an [[integer]], and therefore we say four ''is divisible by'' two.
+
In [[number theory]], '''divisibility''' is the ability of a number to evenly divide another number. The study of divisibility resides at the heart of number theory, constituting the backbone to countless fields of mathematics. Within number theory,
 +
the study of [[arithmetic functions]], [[modular arithmetic]], and [[Diophantine equations]] all depend on divisibility for rigorous foundation.
  
−
==Divisibility Videos==
+
A '''divisor''' of an integer <math>a</math> is an integer <math>b</math> that can be multiplied by some integer to produce <math>a</math>. We may equivalently state that <math>a</math> is a '''multiple''' of <math>b</math>, and that <math>a</math> is '''divisible''' or '''evenly divisible''' by <math>b</math>.
−
https://youtu.be/bIipw2XSMgU
 
−
https://youtu.be/6xNkyDgIhEE?t=1699
 
  
−
== Notation ==
+
== Definition ==
 +
An integer <math>a</math> is divisible by a nonzero integer <math>b</math> if there exists some integer <math>n</math> such that <math>a = bn</math>. We may write this relation as <cmath>b \mid a.</cmath> An alternative definition of divisibility is that the fraction <math>a / b</math> is an integer — or using [[modular arithmetic]], that <math>b \equiv 0 \pmod a</math>. If <math>b</math> does ''not'' divide <math>a</math>, we write that <math>b \nmid a</math>.
  
−
We commonly write <math>n|k</math>. This means that <math>n</math> is a [[divisor]] of <math>k</math>. So for the example above, we would write 2|4.
+
== See Also ==
 +
* [[Arithmetic functions]]
 +
* [[Modular arithmetic]]
 +
* [[Diophantine equations]]
  
−
== See also ==
+
[[Category:Number Theory]]
−
* [[Divisor]]
+
[[Category:Definition]]
−
* [[Divisibility rules]]
 
−
* [[Number theory]]
 

Revision as of 16:06, 29 April 2023

In number theory, divisibility is the ability of a number to evenly divide another number. The study of divisibility resides at the heart of number theory, constituting the backbone to countless fields of mathematics. Within number theory, the study of arithmetic functions, modular arithmetic, and Diophantine equations all depend on divisibility for rigorous foundation.

A divisor of an integer $a$ is an integer $b$ that can be multiplied by some integer to produce $a$. We may equivalently state that $a$ is a multiple of $b$, and that $a$ is divisible or evenly divisible by $b$.

Definition

An integer $a$ is divisible by a nonzero integer $b$ if there exists some integer $n$ such that $a = bn$. We may write this relation as \[b \mid a.\] An alternative definition of divisibility is that the fraction $a / b$ is an integer — or using modular arithmetic, that $b \equiv 0 \pmod a$. If $b$ does not divide $a$, we write that $b \nmid a$.

See Also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Divisibility&oldid=192606"