We first devised tight bounds for the Euler Phi Function. Using these tight bounds we derived a factorization algorithm (for composites of two primes), which takes a guessed phi value within our bounds and derives factors out of it. If we get integer results then we have found the factors, if we don't we guess another number. This ended up being extremely fast, and the equivalent of Fermat factorization. That being said, our method was much simpler (and arguably more elegant) then Fermat factorization. Here are the files that I have left over from this research. I presented this research at the honors convocation which had like 1200 people in attendance.