Find Nth positive number whose digital root is X
Last Updated :
22 Jun, 2022
Given a number X ( 1<= X <= 9) and a positive number N, find the Nth positive number whose digital root is X.
Digital Root: The digital root of a positive number is obtained by iteratively summing up the digits of a number. On each iteration, the number is replaced by the sum of its digit and the iteration stops when the number is reduced to a single digit number. This single digit number is known as the digital root. For example, the digital root of 65 is 2, because 6 + 5 = 11 and 1 + 1 = 2.
Examples:
Input : X = 3, N = 100
Output : 894
The N-th Number whose digit root is X is 894
Input : X = 7, N = 43
Output : 385
Simple Method: The simple method is to start from 1 and calculate the digital root of every number, whenever we come across a number whose digital root is equal to X, we increase our counter by 1. We will stop our search when our counter is equal to N.
Below is the implementation of the above approach:
C++
// C++ program to find the N-th number whose
// digital root is X
#include <bits/stdc++.h>
using namespace std;
// Function to find the digital root of
// a number
int findDigitalRoot(int num)
{
int sum = INT_MAX, tempNum = num;
while (sum >= 10) {
sum = 0;
while (tempNum > 0) {
sum += tempNum % 10;
tempNum /= 10;
}
tempNum = sum;
}
return sum;
}
// Function to find the Nth number with
// digital root as X
void findAnswer(int X, int N)
{
// Counter variable to keep the
// count of valid numbers
int counter = 0;
for (int i = 1; counter < N; ++i) {
// Find digital root
int digitalRoot = findDigitalRoot(i);
// Check if is required answer or not
if (digitalRoot == X) {
++counter;
}
// Print the answer if you have found it
// and breakout of the loop
if (counter == N) {
cout << i;
break;
}
}
}
// Driver Code
int main()
{
int X = 1, N = 3;
findAnswer(X, N);
return 0;
}
// Java program to find the N-th number whose
// digital root is X
class GFG
{
// Function to find the digital root of
// a number
static int findDigitalRoot(int num)
{
int sum = Integer.MAX_VALUE, tempNum = num;
while (sum >= 10)
{
sum = 0;
while (tempNum > 0)
{
sum += tempNum % 10;
tempNum /= 10;
}
tempNum = sum;
}
return sum;
}
// Function to find the Nth number with
// digital root as X
static void findAnswer(int X, int N)
{
// Counter variable to keep the
// count of valid numbers
int counter = 0;
for (int i = 1; counter < N; ++i)
{
// Find digital root
int digitalRoot = findDigitalRoot(i);
// Check if is required answer or not
if (digitalRoot == X)
{
++counter;
}
// Print the answer if you have found it
// and breakout of the loop
if (counter == N)
{
System.out.print( i);
break;
}
}
}
// Driver Code
public static void main(String args[])
{
int X = 1, N = 3;
findAnswer(X, N);
}
}
// This code is contributed by Arnab Kundu
# Python3 program to find the N-th number whose
# digital root is X
import sys
# Function to find the digital root of
# a number
def findDigitalRoot(num):
sum = sys.maxsize;
tempNum = num;
while (sum >= 10):
sum = 0;
while (tempNum > 0):
sum += tempNum % 10;
tempNum //= 10;
tempNum = sum;
return sum;
# Function to find the Nth number with
# digital root as X
def findAnswer(X, N):
# Counter variable to keep the
# count of valid numbers
counter = 0;
i = 0;
while (counter < N):
i += 1;
# Find digital root
digitalRoot = findDigitalRoot(i);
# Check if is required answer or not
if (digitalRoot == X):
counter += 1;
# Print the answer if you have found it
# and breakout of the loop
if (counter == N):
print(i);
break;
# Driver Code
if __name__ == '__main__':
X = 1;
N = 3;
findAnswer(X, N);
# This code is contributed by 29AjayKumar
// C# program to find the N-th number whose
// digital root is X
using System;
class GFG
{
// Function to find the digital root of
// a number
static int findDigitalRoot(int num)
{
int sum = int.MaxValue, tempNum = num;
while (sum >= 10)
{
sum = 0;
while (tempNum > 0)
{
sum += tempNum % 10;
tempNum /= 10;
}
tempNum = sum;
}
return sum;
}
// Function to find the Nth number with
// digital root as X
static void findAnswer(int X, int N)
{
// Counter variable to keep the
// count of valid numbers
int counter = 0;
for (int i = 1; counter < N; ++i)
{
// Find digital root
int digitalRoot = findDigitalRoot(i);
// Check if is required answer or not
if (digitalRoot == X)
{
++counter;
}
// Print the answer if you have found it
// and breakout of the loop
if (counter == N)
{
Console.Write( i);
break;
}
}
}
// Driver Code
public static void Main(String []args)
{
int X = 1, N = 3;
findAnswer(X, N);
}
}
// This code has been contributed by 29AjayKumar
<?php
// PHP program to find the N-th number
// whose digital root is X
// Function to find the digital root
// of a number
function findDigitalRoot($num)
{
$sum = PHP_INT_MAX;
$tempNum = $num;
while ($sum >= 10)
{
$sum = 0;
while ($tempNum > 0)
{
$sum += $tempNum % 10;
$tempNum /= 10;
}
$tempNum = $sum;
}
return $sum;
}
// Function to find the Nth number
// with digital root as X
function findAnswer($X, $N)
{
// Counter variable to keep the
// count of valid numbers
$counter = 0;
for ($i = 1; $counter < $N; ++$i)
{
// Find digital root
$digitalRoot = findDigitalRoot($i);
// Check if is required answer or not
if ($digitalRoot == $X)
{
++$counter;
}
// Print the answer if you have found
// it and breakout of the loop
if ($counter == $N)
{
echo( $i);
break;
}
}
}
// Driver Code
$X = 1; $N = 3;
findAnswer($X, $N);
// This code is contributed by Code_Mech.
<script>
// JavaScript program to find the N-th number whose
// digital root is X
// Function to find the digital root of
// a number
function findDigitalRoot(num) {
var sum = Number.MAX_VALUE, tempNum = num;
while (sum >= 10) {
sum = 0;
while (tempNum > 0) {
sum += tempNum % 10;
tempNum = parseInt(tempNum/10);
}
tempNum = sum;
}
return sum;
}
// Function to find the Nth number with
// digital root as X
function findAnswer(X , N) {
// Counter variable to keep the
// count of valid numbers
var counter = 0;
for (var i = 1; counter < N; ++i) {
// Find digital root
var digitalRoot = findDigitalRoot(i);
// Check if is required answer or not
if (digitalRoot == X) {
counter+=1;
}
// Print the answer if you have found it
// and breakout of the loop
if (counter == N) {
document.write(i);
break;
}
}
}
// Driver Code
var X = 1, N = 3;
findAnswer(X, N);
// This code contributed by gauravrajput1
</script>
Efficient Approach: We can find digital root of a number K directly using the formula:
digitalRoot(k) = (k - 1)mod 9 +1
From this we can find the N-th number whose digital root is K as,
Nth number = (N - 1)*9 + K
Below is the implementation of the above approach:
C++
// C++ program to find the N-th number with
// digital root as X
#include <bits/stdc++.h>
using namespace std;
// Function to find the N-th number with
// digital root as X
int findAnswer(int X, int N)
{
return (N - 1) * 9 + X;
}
// Driver Code
int main()
{
int X = 7, N = 43;
cout << findAnswer(X, N);
return 0;
}
// Java program to find the N-th number with
// digital root as X
class GfG
{
// Function to find the N-th number with
// digital root as X
static int findAnswer(int X, int N)
{
return (N - 1) * 9 + X;
}
// Driver Code
public static void main(String[] args)
{
int X = 7, N = 43;
System.out.println(findAnswer(X, N));
}
}
// This code contributed by Rajput-Ji
# Python3 program to find the N-th
# number with digital root as X
# Function to find the N-th number
# with digital root as X
def findAnswer(X, N):
return (N - 1) * 9 + X;
# Driver Code
X = 7;
N = 43;
print(findAnswer(X, N));
# This code is contributed by mits
// C# program to find the N-th number
// with digital root as X
using System;
class GFG
{
// Function to find the N-th
// number with digital root as X
static int findAnswer(int X, int N)
{
return (N - 1) * 9 + X;
}
// Driver Code
public static void Main()
{
int X = 7, N = 43;
Console.WriteLine(findAnswer(X, N));
}
}
// This code contributed by Ryuga
<?php
// PHP program to find the N-th number
// with digital root as X
// Function to find the N-th number
// with digital root as X
function findAnswer($X, $N)
{
return ($N - 1) * 9 + $X;
}
// Driver Code
$X = 7; $N = 43;
echo(findAnswer($X, $N));
// This code contributed
// by Code_Mech
?>
<script>
// Javascript program to find the N-th number
// with digital root as X
// Function to find the N-th number
// with digital root as X
function findAnswer(X, N)
{
return (N - 1) * 9 + X;
}
// Driver Code
let X = 7;
let N = 43;
document.write(findAnswer(X, N));
// This code is contributed by mohan1240760
</script>
Time Complexity: O(1)
Auxiliary Space: O(1)
Similar Reads
Find a Number X whose sum with its digits is equal to N Given a positive number N. We need to find number(s) such that sum of digits of those numbers to themselves is equal to N. If no such number is possible print -1. Here N \in [1, 1000000000] Examples: Input : N = 21Output : X = 15Explanation : X + its digit sum = 15 + 1 + 5 = 21 Input : N = 5Output :
15+ min read
n-th number whose sum of digits is ten Given an integer value n, find out the n-th positive integer whose sum is 10. Examples: Input: n = 2 Output: 28 The first number with sum of digits as 10 is 19. Second number is 28. Input: 15 Output: 154 Method 1 (Simple): We traverse through all numbers. For every number, we find the sum of digits.
8 min read
Perfect Digital Invariants number A positive integer is called a Perfect Digital Invariant Number if the sum of some fixed power of their digits is equal to the number itself. For any number, abcd... = pow(a, n) + pow(b, n) + pow(c, n) + pow(d, n) + .... , where n can be any integer greater than 0. Check if N is Perfect Digital Inva
6 min read
Print a number containing K digits with digital root D Given a digital root 'D' and number of digits 'K'. The task is to print a number containing K digits that has its digital root equal to D. Print '-1' if such a number does not exist. Examples: Input: D = 4, K = 4 Output: 4000 No. of digits is 4. Sum of digits is also 4. Input: D = 0, K = 1 Output: 0
4 min read
Find the Largest N digit perfect square number in Base B Given two integers N and B, the task is to find the largest N digit numbers of Base B which is a perfect square.Examples: Input: N = 2, B = 10 Output: 81 Explanation: 81 is the largest 2-digit perfect square in base 10.Input: N = 1, B = 8 Output: 4 Explanation: 4 is the largest 1 digit Octal number
9 min read
Digital Root of a given large number using Recursion Given a large number num in the form of string with length as N, the task is to find its digital root. The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains t
7 min read