640 views
3 votes
3 votes
If 10 and 25 are smallest numbers with multilpicative persistence of 1 and 2. What is the smallest number with multiplicative persistence of 4?
 

1. 77

2. Some No.'s > 77

4. None

1 Answer

0 votes
0 votes

If all the digits in a number are multiplied to form a new number in a iteration, then Multiplicative persistence, let P(n), is number of these iterations it takes for a number to reach single digit.

77  : 7*7 =49 : 36 : 18 : 8

4 iterations. Multiplicative Persistence 4.

But as there is option none. We should be sure there is no no., Between 27 and 77, with P(n) :4

Instead of brute forcing all iterations of these 50 digits. Think about this :

For P(n) > 1, the digit 0 doesn't occur and digit 1 doesn't occur and all terms have digits in nondecreasing order.

With little effort from above result you can be sure it is 77.

https://oeis.org/A003001

Related questions

1 votes
1 votes
4 answers
1
Tesla! asked Apr 22, 2018
944 views
let 5,8,11,14,17,20.. be series then 320 will be which term of this series A) 104B) 106C) 962D) 87
3 votes
3 votes
2 answers
2
manikgupta123 asked Apr 28, 2019
1,126 views
How many pairs of positive integers do $m$ and $n$ satisfy in $\frac{1}{m}+\frac{4}{n}=\frac{1}{12}, $ where $n$ is odd and less than $60?$3579
4 votes
4 votes
1 answer
3
lamsal asked May 3, 2017
2,019 views
Let X be a length used to make three sides of a rectangle. Area of rectangle will be:A. $X^{2}/9$B. $(X-a)^{2}/4$C. $(X+a)^{2}/16$D. None of the above
0 votes
0 votes
0 answers
4
Himanshu_2211 asked Apr 8
77 views
What Bakery Algorithm improves: (a). throughput (b). latency (c). both (d). None