I'm trying to find the largest prime number in consecutive digits of e but maple seems to have problems with large integers. Does anyone know a way to make this work better? for i from 0 to 100 do a := floor(e*10^i); #e is the natural base e if isprime(a) then print(a); end if end do it finds the first 3, then gives the error: Error, cannot determine if this expression is true or false: isprime(floor(100000000*exp(1))) I believe it is due to precision of integer values.