We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Fun fact :
- it is estimated that there are 10^80 atoms in the universe.
- it is estimated that in 2018, there were around 10^22 bytes of data stored
- You can store the number N on around log2(N) bits
Biggest N to be tested is 10^400 ,so N^N is... (10^400)^(10^400).
log2((10^400)^(10^400)) = log2(10) * 400^(10^400) >>>>>> 10^80 * 10^22.
If you planned to actually generate and store that number, I hope you do have a good memory : if every atom of the universe was the entire world's memory, you'd still run out of memory :)
And, in the same way :
There are 2^n-1 subsets of a set of length n.
So if you were to generate 2^(10^400) - 1 numbers... Well, same issue :)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #250: 250250
You are viewing a single comment's thread. Return to all comments →
Fun fact :
- it is estimated that there are 10^80 atoms in the universe.
- it is estimated that in 2018, there were around 10^22 bytes of data stored
- You can store the number N on around log2(N) bits
Biggest N to be tested is 10^400 ,so N^N is... (10^400)^(10^400). log2((10^400)^(10^400)) = log2(10) * 400^(10^400) >>>>>> 10^80 * 10^22.
If you planned to actually generate and store that number, I hope you do have a good memory : if every atom of the universe was the entire world's memory, you'd still run out of memory :)
And, in the same way :
There are 2^n-1 subsets of a set of length n.
So if you were to generate 2^(10^400) - 1 numbers... Well, same issue :)