Funny Series

let ,

A[1] = 1

A[i] = A[i-1]+(i-1)+i [i>1]

A[102596325845] % 10 = ?


Details and assumptions :-

M % N means the remainder when M is divided by N.


The answer is 5.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Rajon Bardhan
Oct 14, 2014

1st you need to recognize the pattern.

A[1] = 1 = 1^2
A[2] = 1 + (2-1) + 2 = 1 + 1 + 2 = 4 = 2^2
A[3] = 4 + (3-1) + 3 = 4 + 2 + 3 = 9 = 3^2
A[4] = 9 + (4-1) + 4 = 9 + 3 + 4 = 16 = 4^2
....
A[i] = i^2
... A[102596325845] = 102596325845^2 = 102596325845 * 102596325845 ...


Now you need to know about modulus theory of multiplication

(a * b)%m = ( (a%m) * (b%m) )%m
Here a = 102596325845 , b = 102596325845 and m = 10
So
(102596325845 * 102596325845)%10
= ( (102596325845%10) * (102596325845%10) )%10
= (5 * 5)%10
= 25%10
= 5

Your link but making easier for others Solution By Rajon Bardhan

Edward Brooke - 6 years, 8 months ago
MahIr KaBir
Oct 14, 2014

if you can just find solutions for the first 10 numbers you will find the pattern. For every number ending with 5, the answer is 5. For all numbers from 0 to 9 the pattern is like this: 0 1 4 9 6 5 6 9 4 1. so no matter how large the number is if its Least Significant digit is 5 then answer is 5.

or you can take it this way , every time there is square number generating and if the last digit is 5 in a number no matter what the number is , last digit of its square number will be always 5 . so its 5.

Shakil Ahmed - 6 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...