Jingguo
Posts:
1
Registered:
12/22/11


A interesting number theory problem
Posted:
Dec 22, 2011 3:05 PM


Dear Community,
I'm new in this forum and I'm performing my PhD in Computer Science.
My question is ,Given positive integer number a,b,c, a < c, b < c and gcd(a,b,c) = 1, does there exist integers e,f < log c such that gcd(ae + bf, c) = 1. I think there probably exists such integers, but I do not know how to prove it. Could someone tell me how to prove it or provide a literature about this problem.
Thank you very much.
Regards,
Jingguo

