Presented is the ancient Egyptian algorithm for the operations of multiplication and division of integers and fractions. Theorems involving unit fractions, proved by Fibonacci, justifying and extending the Egyptian or Ahmes' methods into the Hindu-Arabic numeric representational system are given. (MDH)

P-adic or g-adic sets are sets of elements formed by linear combinations of powers of p, a prime number, or g, a counting number, where the coefficients are whole numbers less than p or g. Discusses exercises illustrating basic numerical operations for p-adic and g-adic sets. Provides BASIC computer programs to verify the solutions. (MDH)