Last two digits of powers of 7
Last Updated :
27 Jul, 2022
Given a positive N, the task is to find the last two digits of 7N.
Examples:
Input: N = 5
Output: 07
Explanation:
The value of 75 = 7 * 7 * 7 * 7 * 7 = 8507
Therefore, the last two digits are 07.
Input: N = 12
Output: 01
Explanation:
The value of 712 = 13841287201
Therefore, the last two digits are 01.
Approach: A general approach to finding the last K digits of XY is to discuss this article in logarithmic time complexity. In this article, we will discuss the constant time solution.
Below is the observation for the value of 7N for some values of N:
71 = 7 last two digit = 07
72 = 49 last two digit = 49
73 = 243 last two digit = 43
74 = 2401 last two digit = 01
75 = 16807 last two digit = 07
76 = 117649 last two digit = 49
77 = 823543 last two digit = 43
78 = 5764801 last two digit = 01
Based on the above observations we have the following cases:
- If the last two digit in 7N = 07 when N = 4K + 3.
- If the last two digit in 7N = 49 when N = 4K + 2.
- If the last two digit in 7N = 43 when N = 4K + 1.
- If the last two digit in 7N = 01 when N = 4K.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
string get_last_two_digit( int N)
{
if (N % 4 == 0)
return "01" ;
else if (N % 4 == 1)
return "07" ;
else if (N % 4 == 2)
return "49" ;
return "43" ;
}
int main()
{
int N = 12;
cout << get_last_two_digit(N);
return 0;
}
|
Java
import java.io.*;
import java.util.*;
class GFG{
public static String get_last_two_digit( int N)
{
if (N % 4 == 0 )
return "01" ;
else if (N % 4 == 1 )
return "07" ;
else if (N % 4 == 2 )
return "49" ;
return "43" ;
}
public static void main(String[] args)
{
int N = 12 ;
System.out.println(get_last_two_digit(N));
}
}
|
Python3
def get_last_two_digit(N):
if (N % 4 = = 0 ):
return "01" ;
elif (N % 4 = = 1 ):
return "07" ;
elif (N % 4 = = 2 ):
return "49" ;
return "43" ;
N = 12 ;
print ( get_last_two_digit(N))
|
C#
using System;
namespace GFG{
class GFG{
public static String get_last_two_digit( int N)
{
if (N % 4 == 0)
return "01" ;
else if (N % 4 == 1)
return "07" ;
else if (N % 4 == 2)
return "49" ;
return "43" ;
}
public static void Main()
{
int N = 12;
Console.Write(get_last_two_digit(N));
}
}
}
|
Javascript
<script>
function get_last_two_digit(N)
{
if (N % 4 == 0)
return "01" ;
else if (N % 4 == 1)
return "07" ;
else if (N % 4 == 2)
return "49" ;
return "43" ;
}
var N = 12;
document.write(get_last_two_digit(N));
</script>
|
Time Complexity: O(1)
Auxiliary Space: O(1)
Share your thoughts in the comments
Please Login to comment...