| Bread | yeah I did |
| Bread | And except Binary Tree I understood most of them |
| NoTeefy | oh yeah I got your problem |
| NoTeefy | store it separately before applying the modulo on it |
| Bread | yeah I did :/ |
| NoTeefy | ok that‘s confusing me then |
| Bread | ```java
long c;
c=Math.pow(8,13);``` |
| NoTeefy | it shouldn‘t return any double for both cases |
| Bread | :/ I dont get it either |
| NoTeefy | I have something else |
| NoTeefy | you might wanna use a BigInteger. I always had problems when fiddling around with powers |
| NoTeefy | BigIntegers are awesome. They can store way bigger values and you can also use functions like pow and mod on them |
| NoTeefy | they should be provided by the math class |
| Bread | How do I implemend it? |
| Bread | BitInteger c;? |
| NoTeefy | No BigInteger |
| NoTeefy | They solved all problems for me when using pow operations |
| Bread | Oh sorry I misspelled it |
| NoTeefy | |
| NoTeefy | try something like this. It should work fine 😃 |