example is slightly faked when testing n one actully find first b smooth z z mod n which is another important fact is that we find in this example z less than first is square mod n which is so whole procedure is somehow useless maybe slightly better number n could be find to better ilustrate its application of dixon's method