Is there is a method that can rise n to power of double (instead of power because of big numbers)?
Like this (2^(2.64)) which give us at least 6.
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | maroonrk | 154 |
5 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Power issue!
Is there is a method that can rise n to power of double (instead of power because of big numbers)?
Like this (2^(2.64)) which give us at least 6.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | MuhammedAbdalla | 2020-08-30 01:51:06 | 42 | |||
en2 | MuhammedAbdalla | 2020-08-30 01:47:38 | 22 | |||
en1 | MuhammedAbdalla | 2020-08-30 01:47:12 | 118 | Initial revision (published) |
Name |
---|