Question

60=5*3*2*2
825=5*5*3*11
Find the smallest integer n for which 60n is a multiple of 825
PLEASE don't give wrong/ ridiculous answers or I'll report. And if you know the answer can you explain it a bit, please?

Answer 1

Answer:

49464

Step-by-step explanation:

the the answer is 49,464 that merges answer

Answer 2

Smallest multiple of a given number made of digits 0 and 9 only

We are given an integer N. We need to write a program to find the least positive integer X made up of only digits 9’s and 0’s, such that, X is a multiple of N.

Note: It is assumed that the value of X will not exceed 106.

Examples:

Input : N = 5 Output : X = 90 Exaplanation: 90 is the smallest number made up of 9's and 0's which is divisible by 5. Input : N = 7 Output : X = 9009 Exaplanation: 9009 is smallest number made up of 9's and 0's which is divisible by 7.

Recommended: Please try your approach on {IDE} first, before moving on to the solution.

The idea to solve this problem is to generate and store all of the numbers which can be formed using digits 0 & 9. Then find the smallest number among these generated number which is divisible by N.

We will use the method of generating binary numbers to generate all numbers which can be formed by using digits 0 & 9.

Below is the implementation of above idea:

C++

// CPP program to find smallest multiple of a 

// given number made of digits 0 and 9 only

#include <bits/stdc++.h>

using namespace std;

  

// Maximum number of numbers made of 0 and 9

#define MAX_COUNT 10000

  

// vector to store all numbers that can be formed

// using digits 0 and 9 and are less than 10^5

vector<string> vec;

  

/* Preprocessing function to generate all possible 

   numbers formed by 0 and 9 */

void generateNumbersUtil()

{   

    // Create an empty queue of strings

    queue<string> q;

          

    // enque the first number

    q.push("9");

      

    // This loops is like BFS of a tree with 9 as root

    // 0 as left child and 9 as right child and so on

    for (int count = MAX_COUNT; count > 0; count--)

    {

        string s1 = q.front();

        q.pop();

          

        // storing the front of queue in the vector

        vec.push_back(s1);

          

        string s2 = s1;

          

        // Append "0" to s1 and enqueue it

        q.push(s1.append("0"));

          

        // Append "9" to s2 and enqueue it. Note that

        // s2 contains the previous front

        q.push(s2.append("9"));

    }

}

  

// function to find smallest number made up of only 

// digits 9’s and 0’s, which is a multiple of n.

string findSmallestMultiple(int n)

{   

    // tr

bro for your information I want to tell you that if you will report my answer I will get my points for my answer bi reporting you can only say to the brand that this answer is instead that answer you will get another answer