We describe how to write an algorithm which results in sorting a list into ascending numerical order.

# Category: MR Study Help

## Proving Limits

We begin by formally defining a limit. We then show, step-by-step, how to prove that the limit of a function at a given point is equal to a given value.

## Bijective mappings

We show, step-by-step, how to show that a mapping is a bijection. We do this both directly, and by finding an inverse function.

## Equivalence Relations and Partitions

We show, step-by-step, how to prove that a relation is an equivalence relation. We then find the equivalence classes and the corresponding partition.

## Induction Proof

We show, step-by-step, how to use induction to prove that an equation holds for all natural numbers.