COMPUTATION OF THE POWER OF BASE OF TWO DIGITS NUMBER USING KIFILIDEEN (MATRIX, COMBINATION AND DISTRIBUTIVE (MCD)) APPROACH

Abstract

The different methods used in the multiplication of numbers are long method (column method) of multiplication, grid methods and addition methods of multiplication. The utilization of the methods mentioned to solve power (index) of base number (number that multiply itself in a number of times) are horrendous, outrageous, tedious, time consuming and too long to be carried out. This study develops computation of the power of base of number using Kifilideen (matrix, combination and distributive (MCD)) approach. The Kif matrix method of multiplication is a shorter version of the long method (column method) of multiplication. The matrix method provides a straight forward, direct and systematic means of multiplication of digit number that multiply itself repetitively