PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (210)
Orphanage
Unclass'd (1)
Unproven (473)
Corrections (38)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Medium Entry average rating: Very high
divisibility (Definition)

Given integers $ a$ and $ b$, then we say $ a$ divides $ b$ if and only if there is some $ q \in \mathbb{Z}$ such that $ b=qa$.

There are many other ways in common use to express this relationship:

  • $ a\mid b$ (read “$ a$ divides $ b$”).
  • $ b$ is divisible by $ a$.
  • $ a$ is a factor of $ b$.
  • $ a$ is a divisor of $ b$.
  • $ b$ is a multiple of $ a$.

The notion of divisibility can apply to other rings (e.g., polynomials).



"divisibility" is owned by mathcam. [ full author list (2) | owner history (1) ]
(view preamble)

View style:

See Also: least common multiple, example of gcd, $\tau$ function, exactly divides, divisor sum of an arithmetic function, strict divisibility, fundamental theorem of arithmetic

Other names:  divides, divisor, factor, multiple

Attachments:
divisibility in rings (Definition) by pahio
Log in to rate this entry.
(view current ratings)

Cross-references: polynomials, rings, divisible, integers
There are 326 references to this entry.

This is version 7 of divisibility, born on 2001-11-16, modified 2007-09-11.
Object id is 923, canonical name is Divisibility.
Accessed 20098 times total.

Classification:
AMS MSC: 11A51 (Number theory :: Elementary number theory :: Factorization; primality)
Pending Errata and Addenda
None.
[ View all 5 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)