Given a positive integer X and Y, the task is to find the last digit of X in the given base Y.
Input: X = 10, Y = 7 Output: 3 10 is 13 in base 9 with last digit 3 Input: X = 55, Y = 3 Output: 1 55 is 3 in base 601 with last digit 1
- When we try to convert X into the base Y
- We repeatedly divide X by base Y and store the remainder.
- So the final result comprises of the remainders in the order of division steps.
- Lets say the remainder of division step 1 is p, step 2 is q, step 3 is r
- Then the resultant number in base Y will be rqp
- And the last digit will be p
- Therefore, we just need to find the first remainder of X when divided by Y to get the lsat digit in X in base Y.
last digit = X % Y
Below is the implementation of the above approach:
Time Complexity: O(1)
- C++ program to find all numbers less than n, which are palindromic in base 10 and base 2.
- Given a number N in decimal base, find number of its digits in any base (base b)
- Count of N-digit numbers in base K with no two consecutive zeroes
- Program to find last digit of n'th Fibonnaci Number
- Find the remainder when First digit of a number is divided by its Last digit
- Write a program to add two numbers in base 14
- Find the height of a right-angled triangle whose area is X times its base
- Program for replacing one digit with other
- Program to delete Nth digit of a Number
- Python Program to print digit pattern
- C++ Program for Largest K digit number divisible by X
- C++ Program for Smallest K digit number divisible by X
- Java Program for Smallest K digit number divisible by X
- Java Program for Largest K digit number divisible by X
- Find the Number which contain the digit d
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.