Skip to content

Complete Interview Preparation at 20% off | Use code: PREPAREKARO Check Now

Related Articles

Related Articles

Find unit digit of x raised to power y

View Discussion
Improve Article
Save Article
Like Article
  • Difficulty Level : Medium
  • Last Updated : 23 Jun, 2022

Given two numbers x and y, find unit digit of xy.

Examples : 

Input  : x = 2, y = 1
Output : 2
Explanation
2^1 = 2 so units digit is 2.

Input : x = 4, y = 2
Output : 6
Explanation
4^2 = 16 so units digit is 6.

Method 1 (Simple) Compute value of xy and find its last digit. This method causes overflow for slightly larger values of x and y.
Method 2 (Efficient) 
1) Find last digit of x. 
2) Compute x^y under modulo 10 and return its value. 

C++




// Efficient C++ program to
// find unit digit of x^y.
#include <bits/stdc++.h>
using namespace std;
 
// Returns unit digit of x
// raised to power y
int unitDigitXRaisedY(int x, int y)
{
    // Initialize result as 1 to
    // handle case when y is 0.
    int res = 1;
 
    // One by one multiply with x
    // mod 10 to avoid overflow.
    for (int i = 0; i < y; i++)
        res = (res * x) % 10;
 
    return res;
}
 
// Driver program
int main()
{ 
   cout << unitDigitXRaisedY(4, 2);
   return 0;
}

Java



// Efficient Java program to find
// unit digit of x^y.
import java.io.*;
 
class GFG {
    // Returns unit digit of x raised to power y
    static int unitDigitXRaisedY(int x, int y)
    {
        // Initialize result as 1 to
        // handle case when y is 0.
        int res = 1;
     
        // One by one multiply with x
        // mod 10 to avoid overflow.
        for (int i = 0; i < y; i++)
            res = (res * x) % 10;
     
        return res;
    }
     
    // Driver program
    public static void main(String args[])throws IOException
    {
    System.out.println(unitDigitXRaisedY(4, 2));
    }
}
 
// This code is contributed by Nikita Tiwari.
Python3



# Python3 code to find
# unit digit of x^y.
 
# Returns unit digit of
# x raised to power y
def unitDigitXRaisedY( x , y ):
 
    # Initialize result as 1 to
    # handle case when y is 0.
    res = 1
     
    # One by one multiply with x
    # mod 10 to avoid overflow.
    for i in range(y):
        res = (res * x) % 10
     
    return res
     
# Driver program
print( unitDigitXRaisedY(4, 2))
 
 
# This code is contributed by Abhishek Sharma44.
C#



// Efficient Java program to find
// unit digit of x^y.
using System;
 
class GFG
{
    // Returns unit digit of x raised to power y
    static int unitDigitXRaisedY(int x, int y)
    {
        // Initialize result as 1 to
        // handle case when y is 0.
        int res = 1;
     
        // One by one multiply with x
        // mod 10 to avoid overflow.
        for (int i = 0; i < y; i++)
            res = (res * x) % 10;
     
        return res;
    }
     
    // Driver program
    public static void Main()
    {
    Console.WriteLine(unitDigitXRaisedY(4, 2));
    }
}
 
// This code is contributed by vt_m.
PHP



<?php
// Efficient PHP program to
// find unit digit of x^y.
 
// Returns unit digit of x
// raised to power y
function unitDigitXRaisedY($x, $y)
{
    // Initialize result as 1 to
    // handle case when y is 0.
    $res = 1;
 
    // One by one multiply with x
    // mod 10 to avoid overflow.
    for ($i = 0; $i < $y; $i++)
        $res = ($res * $x) % 10;
 
    return $res;
}
 
// Driver Code
echo(unitDigitXRaisedY(4, 2));
 
// This code is contributed by Ajit.
?>
Javascript



<script>
 
// Efficient Javascript program to
// find unit digit of x^y.
 
// Returns unit digit of x
// raised to power y
function unitDigitXRaisedY(x, y)
{
     
    // Initialize result as 1 to
    // handle case when y is 0.
    let res = 1;
 
    // One by one multiply with x
    // mod 10 to avoid overflow.
    for(let i = 0; i < y; i++)
        res = (res * x) % 10;
 
    return res;
}
 
// Driver Code
document.write(unitDigitXRaisedY(4, 2));
 
// This code is contributed by _saurabh_jaiswal.
 
</script>
Output : 
6
Time Complexity: O(y), where y is the power
Auxiliary Space: O(1), as no extra space is required
Further Optimizations: We can compute modular power in Log y.
Method 3 (Direct based on cyclic nature of last digit) 
This method depends on the cyclicity with the last digit of x that is
x   |  power 2  |  power 3  |   power 4  | Cyclicity  
0   | .................................. |  .... repeat with 0
1   | .................................. |  .... repeat with 1
2   |     4     |     8     |      6     | .... repeat with 2
3   |     9     |     7     |      1     | .... repeat with 3
4   |     6     |....................... |  .... repeat with 4
5   | .................................. |  .... repeat with 5
6   | .................................. |  .... repeat with 6
7   |     9     |     3     |      1     | .... repeat with 7
8   |     4     |     2     |      6     | .... repeat with 8
9   |     1     | ...................... |  .... repeat with 9 
So here we directly mod the power y with 4 because this is the last power after this all number’s repetition start 
after this we simply power with number x last digit then we get the unit digit of produced number. 
C++



// C++ code to find the unit digit of x
// raised to power y.
#include<iostream>
#include<math.h>
using namespace std;
 
// find unit digit
int unitnumber(int x, int y)
{
    // Get last digit of x
    x = x % 10;
       
    // Last cyclic modular value
    if(y!=0)
        y = y % 4 + 4;
 
    // here we simply return the
    // unit digit or the power
    // of a number
    return (((int)(pow(x, y))) % 10);
}
 
int main()
{
    int x = 133, y = 5;
     
    // get unit digit number here we pass
    // the unit  digit of x and the last
    // cyclicity number that is y%4
    cout << unitnumber(x, y);
  
    return 0;
}
Java



// Java code to find the unit
// digit of x  raised to power y.
import java.io.*;
import java.util.*;
 
class GFG {
     
    // find unit digit
    static int unitnumber(int x, int y)
    {
        // Get last digit of x
        x = x % 10;
             
        // Last cyclic modular value
        if(y!=0)
             y = y % 4 + 4;
     
        // here we simply return the
        // unit digit or the power
        // of a number
        return (((int)(Math.pow(x, y))) % 10);
    }
     
     
    public static void main (String[] args)
    {
        int x = 133, y = 5;
     
        // get unit digit number here we pass
        // the unit digit of x and the last
        // cyclicity number that is y%4
        System.out.println(unitnumber(x, y));
     
    }
}
 
// This code is contributed by Gitanjali.
Python3



# Python3 code to find the unit  
# digit of x raised to power y.
import math
 
# Find unit digit
def unitnumber(x, y):
 
    # Get last digit of x
    x = x % 10
         
    # Last cyclic modular value
    if y!=0:
         y = y % 4 + 4
 
    # Here we simply return 
    # the unit digit or the 
    # power of a number
    return (((int)(math.pow(x, y))) % 10)
 
 
# Driver code
x = 133; y = 5
     
# Get unit digit number here we pass
# the unit digit of x and the last
# cyclicity number that is y%4
print(unitnumber(x, y))
 
 
# This code is contributed by Gitanjali.
C#



// C# code to find the unit
// digit of x raised to power y.
using System;
 
class GFG {
     
    // find unit digit
    static int unitnumber(int x, int y)
    {
        // Get last digit of x
        x = x % 10;
             
        // Last cyclic modular value
        if(y!=0)
             y = y % 4 + 4;
     
        // here we simply return the
        // unit digit or the power
        // of a number
        return (((int)(Math.Pow(x, y))) % 10);
    }
     
    // Driver code
    public static void Main ()
    {
        int x = 133, y = 5;
     
        // get unit digit number here we pass
        // the unit digit of x and the last
        // cyclicity number that is y%4
        Console.WriteLine(unitnumber(x, y));
     
    }
}
 
// This code is contributed by vt_m.
PHP



<?php
// PHP code to find the unit
// digit of x raised to power y.
 
// find unit digit
function unitnumber($x, $y)
{
    // Get last digit of x
    $x = $x % 10;
     
    // Last cyclic modular value
    if($y!=0)
        $y = $y % 4 + 4;
 
    // here we simply return the
    // unit digit or the power
    // of a number
    return (((int)(pow($x, $y))) % 10);
}
 
// Driver code
$x = 133; $y = 5;
     
// get unit digit number here we pass
// the unit digit of x and the last
// cyclicity number that is y%4
echo(unitnumber($x, $y));
 
// This code is contributed by Ajit.
?>
Javascript



<script>
 
// Javascript code to find the unit
// digit of x raised to power y.
 
// find unit digit
function unitnumber(x, y)
{
     
    // Get last digit of x
    x = x % 10;
     
    // Last cyclic modular value
    if (y != 0)
        y = y % 4 + 4;
 
    // here we simply return the
    // unit digit or the power
    // of a number
    return ((parseInt(Math.pow(x, y))) % 10);
}
 
// Driver code
let x = 133;
let y = 5;
     
// get unit digit number here we pass
// the unit digit of x and the last
// cyclicity number that is y%4
document.write(unitnumber(x, y));
 
// This code is contributed by _saurabh_jaiswal.
 
</script>
Output : 
3
Time Complexity: O(log n)
Auxiliary Space: O(1)
Thanks to DevanshuAgarwal for suggesting above solution.
How to handle large numbers? 
Efficient method for Last Digit Of a^b for Large Numbers
 

My Personal Notes
arrow_drop_up
Previous
Dekker's algorithm in Process Synchronization
Next

Count frequency of k in a matrix of size n where matrix(i, j) = i+j
Recommended Articles
Page :
Larger of a^b or b^a (a raised to power b or b raised to power a)
08, Dec 18
Find the sum of power of bit count raised to the power B
09, Jan 20
Find last five digits of a given five digit number raised to power five
08, Mar 19
K-th digit in 'a' raised to power 'b'
09, Jan 18
Last digit of a number raised to last digit of N factorial
12, Jun 20
Find value of y mod (2 raised to power x)
27, Feb 18
Find two non-intersecting subarrays having equal sum of all elements raised to the power of 2
23, Dec 20
Find GCD between the sum of two given integers raised to the power of N and their difference
13, Jan 21
Find all pairs raised to power K differs by exactly N
15, Mar 21
Find multiple of x closest to or a ^ b (a raised to power b)
29, Aug 17
Print last k digits of a^b (a raised to power b)
12, Jul 17
Number of digits in 2 raised to power n
21, Mar 18
Minimum removals in a number to be divisible by 10 power raised to K
15, Dec 18
Count numbers from a given range that can be expressed as sum of digits raised to the power of count of digits
02, Mar 21
Maximize sum of each element raised to power of its frequency in K sized subarray
14, Dec 21
GCD of a number raised to some power and another number
19, Nov 18
Calculate the value of 2 raised to the power of twice the binary representation of N
03, Jan 21
Sum of absolute difference of all pairs raised to power K
20, Jun 20
Check if a number can be expressed as x^y (x raised to power y)
20, Oct 15
Find the unit place digit of sum of N factorials
28, Oct 18
Count of N-digit numbers having digit XOR as single digit
13, Aug 20
Minimum count of numbers required with unit digit X that sums up to N
06, Jul 20
Count numbers with unit digit k in given range
10, Dec 17
Sum of integers upto N with given unit digit
17, Dec 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Shahnawaz_Ali
@Shahnawaz_Ali
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!