As far as I understand Julia adjusts the bitsize of an integer when I use
BigInt.
For example n=big(10)^10000 is as many bits as needed.
Now 2*n is still an integer though dividing makes a bigfloat out of it. How
big is the bigfloat? does it "resolve" up to the last integer? Does it
increase with size like bigint would?
for example (n/2)^10 is still legid up to the last digit (neglecting the
fact that these would be zero in this case anyway)
When dividing n by an integer and the result is an an integer, how would I
achieve this?
Is there already a simple way?
For example I could represent n in some basis b and look where the right
most digit is zero and then bitshift, but the bitshift I found in the
manual mainly << >> .>> etc.. do not work or I'm too stupid
how am I supposed to use these?
3 << ?
