This a blog post that is updated periodically during the GSoC project focusing on using speech and text translation to facilitate storing text, audio, and video files in multiple languages and using this to build a multilingual network for users. The task is to build a multilingual messaging board where users are able to translate their text, audio, and video files to be in the native language of other users they wish to communicate with or simply wish to translate for themselves.
Given the need for people around the world of different backgrounds, with different linguistic heritages, to communicate with…
Standard practice algorithms for prime factorization of a integer n known to be composite of two primes, p and q, use the modular structure of integers to attempt to do prime factorization. We present a very simple and intuitive algorithm for prime factorization on a simpler premise, that n is the product of two integers and only two integers. Note that p > sqrt(n) WLOG.
p = sqrt(n)
q = n / p
num_runs = 0while abs(int(p) - p) > 0 and abs(int(q) - q) > 0:
if num_runs % 2 == 0
p = ceil(p)
q = n / p
q = floor(q)
p = n / q
num_runs += 1
return p, q
Potentially, the residues can be exploited to speed up this silly algorithm.