Never mind I messed up.
n=sym('94315998522576010519588224930693232398146802027362761139521');a=7;i=1;%this is a counter that starts from 1.
for i=1:inf remainder=mod(n-1,2^i); if remainder~=0 break endendr=i-1%r takes the second last value of i because 2 raised to the last value is not divisible by n-1
s=rdivide(n-1,2^r)%this is the integer we get after n-1 is divided by the 2^(i-1)
Best Answer