i need help rewriting the code

factorization of N. The following input would determine the prime p and a such that pq = N by testing the divisibility of N with increasing integers i by checking if N = 0 mod i. This function takes a long time and cannot determine the divisibility of N, which tells us prime divisors are not small. sqn = round(sqrt(N)) i - 2 while N%(i) != 0 and i