Open GitBingo opened 7 years ago
A simple log base N function could something similar to the below
log(InfInt num, int base) { return num.numberOfDigits() / ceil(log10(base)); }
There are tips for implementing this operation here: https://stackoverflow.com/questions/8232932/logarithm-of-the-very-very-large-number
A simple log base N function could something similar to the below
log(InfInt num, int base) { return num.numberOfDigits() / ceil(log10(base)); }