retagged by
838 views
0 votes
0 votes

Can anyone explain this?

retagged by

2 Answers

1 votes
1 votes

The given number N can be represented in logN bits which is n. (given) {  log N = n or N = $2^{n}$}

So, to represent N!, we need at least logN! bits.

And, according to Stirling’s approximation log n! $\approx$ n log n

We can write logN! = N log N

Therefore, we can write $2^{n} n$ are the bits from N! numbers can be represented.

In the options, none of them is matching.

But if you still want the correct option, you can go with the most suitable answer matched that is $2^{n}$.

 

1 votes
1 votes
We know that the no of bits to represent a binary number n is : log(n)

Here it's asked for n! So number of bits required to represent N! is log(N!). Using Sterling's approximation, log(N!) is asymptotically equal to ≈ Nlog(N).

So answer is A) Nlog(N)

Related questions

2 votes
2 votes
1 answer
1
1 votes
1 votes
1 answer
2
0 votes
0 votes
0 answers
3
Pranavpurkar asked Sep 27, 2022
538 views
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the...
0 votes
0 votes
0 answers
4