retagged by
293 views
0 votes
0 votes
**Given an integer, n, find the smallest integer m such that is divisible by n (i.e.n,  is a factor of m ) and satisfies the following properties:**

1. **m** must not contain zeroes in its decimal representation.
2. The sum of **m's** digits must be greater than or equal to the product of **m's** digits.
Given **n**, find the number of digits in **m's** decimal representation.

*Note: n is not divisible by 10.*
retagged by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
1 votes
1 votes
0 answers
2
srestha asked May 19, 2019
596 views
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
1 votes
1 votes
2 answers
3
srestha asked May 10, 2019
847 views
What is the solution of recurrence relation$T\left ( n \right )=T\left ( n-1 \right )+n$
1 votes
1 votes
1 answer
4
VikramRB asked Jan 20, 2019
1,005 views
What is the time complexity of the following recurrence relation and step to derive the same$T(n) = T(\sqrt{n}) + log(logn)$