ONLY SEE IT BY DOWNLOADING OR ELSE IT GIVES ERRORS AFTER 53. I HAVE UPGRADED THIS PROJECT. DO SEE ITS NEW VERSION http://scratch.mit.edu/projects/Subh/1087987 This project is a very fast version of scmb1's project http://scratch.mit.edu/projects/scmb1/978284 and uses the formula of (2^n)-2/n. J is the no. to be checked and K is the value of (2^n)-2. Instead of generating k again and again, I used the previous values of k to generate the next value of k to speed it up. I guess it should be a lot faster. Feeling sorry for the maths involved Tell me if I'm wrong.
