14,460 views

1 Answer

Best answer
5 votes
5 votes
The concept is the maximum number of 10 digit number by 10 digit should be equal to x digit number in base 2.

so $10^{25}$-1 = $2^x$-1

taking log both side . take log of base 2 so that RHS can become x

25log10 base 2 = x.

x=82.5 .so to represent we will need 83 digits.

Related questions

0 votes
0 votes
1 answer
1
Aghori asked Nov 13, 2017
2,334 views
I think it is $8$ bits including sign bit. But given answer is $7$ bits. Am I wrong?
2 votes
2 votes
2 answers
3
sh!va asked Jul 9, 2016
833 views
The minimum number of radix-64 digits needed to represent an unsigned 64-bit binary number is (A) 10(B) 11(C) 12(D) None of these
0 votes
0 votes
1 answer
4
aoao asked Sep 26, 2018
2,458 views
The Answer is 3. But I think only 2 are required as R2 is many(E3) to one(E1) with total participation.Thus tables formed E2R1(DFA) with pk as DA. R2(GHABC) with pk as G....