Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » geometry.puzzles.independent

Topic: A interesting number theory problem
Replies: 1   Last Post: Jan 15, 2012 9:51 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Jingguo

Posts: 1
Registered: 12/22/11
A interesting number theory problem
Posted: Dec 22, 2011 3:05 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.