Editor s note: This article contains a lot of mathematical equations, which due to the limitations of HTML have been

depicted as images. If you are able to view the equations, all is well. If not, please make sure your browser is not blocking image content.

Figuring out the last digit is the same as figuring out the remainder of a numbe r when divided by 10, but I guess you already know that. Figuring out the last two digits is the same as figuring out the remainder of a number when divided by 100. Even if you don t already know how to do that, you can always read this post. However, if you wish to figure the remainder when the divisor is not 10 or 100, I suggest you read on . Funda 1: Basic idea of remainders can be used to solve complicated problems.

There is nothing special or unique about this idea. At first glance it seems rea lly obvious. But it is its usage that makes it special and helpful in questions related to remainders. Let us look at couple of examples to see how this can be used effectively. In th e first example we will see the idea that will work in cases of ab and in the second example we will see the ide a that will work in case of ab^c Example 1: Find out the remainder when 2525 is divided by 7.

Example 2: Find out the remainder when 2526^27 is divided by 7.

We know that 43 gives a remainder of 1, when divided by 7. So, if we have 43k, it will give a remainder of 1 when divided by 7 If we have 43k+1, it will give a remainder of 4 when divided by 7 If we have 43k+2, it will give a remainder of 2 when divided by 7 So, we need to reduce 2627 as 3k or 3k+1 or 3k+2. If we can do that, we will kno w the answer. So our task has now been reduced to figuring out,

Note: As you can see in solving this example, we have used the concept of negati ve remainder. In some cases, using the negative remainder can reduce your calculations signifi cantly. It is recommended that you practice some questions using negative remainders ins tead of positive ones.

Funda 2: While trying to find out the remainder, if the dividend (M) and the div isor (N) have a factor (k) in common; then, ? Cancel out the common factor ? Find out the remainder from the remaining fraction ? Multiply the resulting remainder with the common factor to get the actual rema inder In equation format, this can be written as:

Example: Find out the remainder when 415 is divided by 28.

Funda 3: While trying to find out the remainder, if the divisor can be broken do wn into smaller co-prime factors; then

Note: If you wish to read more about it and how it happens, I suggest you read a bout the Chinese Remainder Theorem. Example: Find out the remainder when 715 is divided by 15.

By using the above fundas, solving remainder problems will get a little easier. But if you are thinking, that this is all you need to know to solve remainder problems in CAT athematicians like Euler, I beg to differ. Great m

Fermat & Wilson developed some theorems that come in handy while solving remaind er questions. We will discuss these in my next post.