Skip to content
Related Articles

Related Articles

Improve Article
Check whether a number can be expressed as a product of single digit numbers
  • Last Updated : 16 Apr, 2021

Given a non-negative number n. The problem is to check whether the given number n can be expressed as a product of single digit numbers or not.
Examples: 
 

Input : n = 24
Output : Yes
Different combinations are:
(8*3) and (6*4)

Input : 68
Output : No
To represent 68 as product of 
number, 17 must be included which
is a two digit number.

 

Approach: We have to check whether the number n has no prime factors other than 2, 3, 5, 7. For this we repeatedly divide the number n by (2, 3, 5, 7) until it cannot be further divided by these numbers. After this process if n == 1, then it can be expressed as a product of single digit numbers, else if it is greater than 1, then it cannot be expressed.
 

C++




// C++ implementation to check whether a number can be
// expressed as a product of single digit numbers
#include <bits/stdc++.h>
using namespace std;
 
// Number of single digit prime numbers
#define SIZE 4
 
// function to check whether a number can be
// expressed as a product of single digit numbers
bool productOfSingelDgt(int n)
{
    // if 'n' is a single digit number, then
    // it can be expressed
    if (n >= 0 && n <= 9)
        return true;
 
    // define single digit prime numbers array
    int prime[] = { 2, 3, 5, 7 };
 
    // repeatedly divide 'n' by the given prime
    // numbers until all the numbers are used
    // or 'n' > 1
    for (int i = 0; i < SIZE && n > 1; i++)
        while (n % prime[i] == 0)
            n = n / prime[i];
 
    // if true, then 'n' can
    // be expressed
    return (n == 1);
}
 
// Driver program to test above
int main()
{
    int n = 24;
    productOfSingelDgt(n)? cout << "Yes" :
                           cout << "No";
    return 0;
}
Java



// Java implementation to check whether
// a number can be expressed as a
// product of single digit numbers
import java.util.*;
 
class GFG
{
 
// Number of single digit prime numbers
static int SIZE = 4;
 
// function to check whether a number can
// be expressed as a product of single
// digit numbers
static boolean productOfSingelDgt(int n)
{
    // if 'n' is a single digit number,
    // then it can be expressed
    if (n >= 0 && n <= 9)
        return true;
 
    // define single digit prime numbers
    // array
    int[] prime = { 2, 3, 5, 7 };
 
    // repeatedly divide 'n' by the given
    // prime numbers until all the numbers
    // are used or 'n' > 1
    for (int i = 0; i < SIZE && n > 1; i++)
        while (n % prime[i] == 0)
            n = n / prime[i];
 
    // if true, then 'n' can
    // be expressed
    return (n == 1);
}
 
// Driver program to test above
public static void main (String[] args)
{
    int n = 24;
    if(productOfSingelDgt(n))
    System.out.println("Yes");
    else
    System.out.println("No");
}
     
}
/* This code is contributed by Mr. Somesh Awasthi */
Python3



# Python3 program to check
# whether a number can be
# expressed as a product of
# single digit numbers
 
# Number of single digit
# prime numbers
SIZE = 4
 
# function to check whether
# a number can be
# expressed as a product
# of single digit numbers
def productOfSingelDgt(n):
 
    # if 'n' is a single digit
        # number, then
    # it can be expressed
    if n >= 0 and n <= 9:
        return True
 
    # define single digit prime
        # numbers array
    prime = [ 2, 3, 5, 7 ]
 
    # repeatedly divide 'n' by
        # the given prime
    # numbers until all the
        # numbers are used
    # or 'n' > 1
    i = 0
    while i < SIZE and n > 1:
        while n % prime[i] == 0:
            n = n / prime[i]
        i += 1
 
    # if true, then 'n' can
    # be expressed
    return n == 1
 
n = 24
if productOfSingelDgt(n):
    print ("Yes")
else :
    print ("No")
 
# This code is contributed
# by Shreyanshi Arun.
C#



// C# implementation to check whether
// a number can be expressed as a
// product of single digit numbers
using System;
 
class GFG {
 
    // Number of single digit prime numbers
    static int SIZE = 4;
 
    // function to check whether a number can
    // be expressed as a product of single
    // digit numbers
    static bool productOfSingelDgt(int n)
    {
        // if 'n' is a single digit number,
        // then it can be expressed
        if (n >= 0 && n <= 9)
            return true;
 
        // define single digit prime numbers
        // array
        int[] prime = { 2, 3, 5, 7 };
 
        // repeatedly divide 'n' by the given
        // prime numbers until all the numbers
        // are used or 'n' > 1
        for (int i = 0; i < SIZE && n > 1; i++)
            while (n % prime[i] == 0)
                n = n / prime[i];
 
        // if true, then 'n' can
        // be expressed
        return (n == 1);
    }
 
    // Driver program to test above
    public static void Main()
    {
        int n = 24;
        if (productOfSingelDgt(n))
            Console.WriteLine("Yes");
        else
            Console.WriteLine("No");
    }
 
}
 
// This code is contributed by Sam007
PHP



<?php
// PHP implementation to check
// whether a number can be
// expressed as a product of
// single digit numbers
 
// function to check whether
// a number can be expressed
//as a product of single
// digit numbers
function productOfSingelDgt($n,$SIZE)
{
     
    // if 'n' is a single
    // digit number, then
    // it can be expressed
    if ($n >= 0 && $n <= 9)
        return true;
 
    // define single digit
    // prime numbers array
    $prime = array(2, 3, 5, 7);
 
    // repeatedly divide 'n'
    // by the given prime
    // numbers until all
    // the numbers are used
    // or 'n' > 1
    for ($i = 0; $i < $SIZE && $n > 1; $i++)
        while ($n % $prime[$i] == 0)
            $n = $n / $prime[$i];
 
    // if true, then 'n' can
    // be expressed
    return ($n == 1);
}
 
    // Driver Code
    $SIZE = 4;
    $n = 24;
    if(productOfSingelDgt($n, $SIZE))
        echo "Yes" ;
    else
        echo "No";
 
// This code is contributed by Sam007
?>
Javascript



<script>
// javascript implementation to check whether
// a number can be expressed as a
// product of single digit numbers
 
    // Number of single digit prime numbers
    const SIZE = 4;
 
    // function to check whether a number can
    // be expressed as a product of single
    // digit numbers
    function productOfSingelDgt(n)
    {
     
        // if 'n' is a single digit number,
        // then it can be expressed
        if (n >= 0 && n <= 9)
            return true;
 
        // define single digit prime numbers
        // array
        var prime = [ 2, 3, 5, 7 ];
 
        // repeatedly divide 'n' by the given
        // prime numbers until all the numbers
        // are used or 'n' > 1
        for (i = 0; i < SIZE && n > 1; i++)
            while (n % prime[i] == 0)
                n = n / prime[i];
 
        // if true, then 'n' can
        // be expressed
        return (n == 1);
    }
 
    // Driver program to test above
        var n = 24;
        if (productOfSingelDgt(n))
            document.write("Yes");
        else
            document.write("No");
 
// This code is contributed by gauravrajput1
</script>
Output: 
 
Yes
Time Complexity: O(num), where num is the number of prime factors (2, 3, 5, 7) of n.
This article is contributed by Ayush Jauhari. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 
Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.



My Personal Notes
arrow_drop_up
Next

Find if n can be written as product of k numbers
Recommended Articles
Page :
Largest palindrome not exceeding N which can be expressed as product of two 3-digit numbers
14, Dec 20
Check if N can be expressed as product of 3 distinct numbers
30, Mar 20
Check if a number can be expressed as a product of exactly K prime divisors
22, Apr 20
Maximum of sum and product of digits until number is reduced to a single digit
28, Sep 18
Check if a number can be expressed as a sum of consecutive numbers
09, Nov 16
Check if a number can be expressed as sum two abundant numbers
10, Jan 19
Check if all sub-numbers have distinct Digit product
29, Oct 18
Check if a given number can be expressed as pair-sum of sum of first X natural numbers
12, Sep 20
Check if number can be made prime by deleting a single digit
20, Aug 20
Count of N-digit numbers having digit XOR as single digit
13, Aug 20
Check if a prime number can be expressed as sum of two Prime Numbers
22, Nov 18
Numbers less than N that are perfect cubes and the sum of their digits reduced to a single digit is 1
08, Feb 19
Check if a number can be expressed as 2^x + 2^y
14, Sep 18
Check if a number can be expressed as a^b | Set 2
06, Oct 18
Check if a number N can be expressed in base B
04, Aug 20
Check if a number N can be expressed as the sum of powers of X or not
25, May 21
Check if a number can be expressed as power | Set 2 (Using Log)
13, May 18
Finding sum of digits of a number until sum becomes single digit
08, Oct 16
Program to check if a number can be expressed as an even power of 2 or not
09, Mar 21
Check if a number can be expressed as x^y (x raised to power y)
20, Oct 15
Check if a number can be expressed as sum of two Perfect powers
18, Aug 20
First digit in product of an array of numbers
17, Jun 17
Number obtained by reducing sum of digits of 2N into a single digit
23, Mar 21
Last digit of Product of two Large or Small numbers (a * b)
12, Mar 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty





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