This document discusses permutations and provides examples of calculating permutations using a scientific calculator. It defines permutation as the ordered arrangement of distinguishable objects without allowing repetitions. It covers key concepts like factorial notation (n!), permutation of n objects (nPn), distinguishable permutation, and permutation of n objects taken r at a time (nPr). Examples are provided to demonstrate calculating permutations of arrangements, circular permutations, and permutations with repeated objects. Applications and non-applications of permutations are also discussed.