Given an integer N, the task is to find the count of natural Hexadecimal numbers with N digits.
Input: N = 1
Input: N = 2
Approach: It can be observed that for the values of N = 1, 2, 3, …, a series will be formed as 15, 240, 3840, 61440, 983040, 15728640, … which is a GP series whose common ratio is 16 and a = 15.
Hence the nth term will be 15 * pow(16, n – 1).
So, the count of n-digit natural hexadecimal numbers will be 15 * pow(16, n – 1).
Below is the implementation of the above approach:
Time Complexity: O(1)
- Count non decreasing subarrays of size N from N Natural numbers
- Count natural numbers whose factorials are divisible by x but not y
- Count pairs of natural numbers with GCD equal to given number
- Count natural numbers whose all permutation are greater than that number
- Count set bits in the Kth number after segregating even and odd from N natural numbers
- Program to find sum of first n natural numbers
- Find the average of first N natural numbers
- Find if given number is sum of first n natural numbers
- Find sum of N-th group of Natural Numbers
- Find m-th summation of first n natural numbers.
- Find the good permutation of first N natural numbers
- Find maximum N such that the sum of square of first N natural numbers is not more than X
- Find the permutation of first N natural numbers such that sum of i % Pi is maximum possible
- Find permutation of first N natural numbers that satisfies the given condition
- Find the number of sub arrays in the permutation of first N natural numbers such that their median is M
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.