greatest common factor
its clear that for a composite numbre n = ab
n1 divide gcf(a1,b1)
if gcf are a big numbre we can use it for factoring n
this what make the contruction of RSA numbre (beware) of making gcf small and does not help for factoring
example
n= 14111 = 103* 137
14110 = 0 MOD 34
and of course gcf(102,136) = 34
Last fiddled with by baih on 20200917 at 22:35
