ABSTRACT
Divisibility and its associated algorithms have applications that lead to interesting sets of numbers and some open questions in mathematics. In this chapter, we introduce several topics that directly illustrate properties of divisibility and divisors of an integer, including formulas for sum and number of divisors, perfect numbers, and the Fibonacci numbers. We also show how algorithms can be used to find least common multiples and define arithmetic in the rational numbers. We end this chapter with a discussion of Egyptian fractions.
