20100415, 01:20  #1 
"Bo Chen"
Oct 2005
Wuhan,China
3×61 Posts 
Ask a number theory question
This week I meet a problem that can't be solved by myself totally, so here it is.
Let a, b be two positive integers, a<b. Then what's the smallest number could be expressed as i*a+j*b, where i and j are integers, i>1,j>1. For example, if a=3,b=4,then c=6,since 5 can not be expressed as i*3+j*4 and 6=2*3+0*4,7=1*3+1*4,8=0*3+2*4,9=3*3+0*4,etc. And Then if a is an even number, b=a+1, it seems like c=a^2a, but I don't know how to proof it. Another question is if a is an odd number and b=a+2,how to compute c and is there a simple formula to express c? Thanks for your attention. Bo Chen 
20100415, 05:01  #2  
Aug 2005
Seattle, WA
19·97 Posts 
Quote:


20100415, 05:41  #3 
May 2003
1547_{10} Posts 
I think the problem is supposed to be: find the *largest* number which is *not* expressible in that form. This is often called the Chicken McNugget Theorem

20100415, 07:05  #4 
"Bo Chen"
Oct 2005
Wuhan,China
3×61 Posts 

20100415, 07:11  #5  
"Bo Chen"
Oct 2005
Wuhan,China
3×61 Posts 
Quote:
Thanks very much. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Help with a number theory equivalence  lukerichards  Number Theory Discussion Group  7  20180129 14:58 
probabilistic number theory  wildrabbitt  Math  57  20150917 18:26 
Easy number theory.  mfgoode  Puzzles  2  20060530 09:46 
number theory help  math  Homework Help  2  20040502 18:09 
A problem of number theory  hyh1048576  Puzzles  0  20030928 15:35 