Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 36 Online
OpenStudy (anonymous):

Hi, fellow Python studiers. I've been hard at work solving problem set #2 for the 2008 version of 6.00. Based on what I've seen other people submitting, I feel I have the correct answers. Here is my code for part 4, which finds the largest non-solution integer to a Diophantine equation of xa+yb+zc=n where x, y, and z are integer coefficients. For example, equation 6a+9b+20c=n I have 43 as the largest integer without a solution. My biggest concern I have is making sure my for looping conditions are correct, as I haven't seen anyone else calculate the problem exactly like this: http://dpaste.com/1326796

OpenStudy (anonymous):

comments in your code would help. your solution works - so your looping conditions must be correct. here is mine http://dpaste.com/1327950/

OpenStudy (anonymous):

Thanks. I should have posted the code from the first problem set- it was better commented. For anyone interested, this code finds all solutions to 6a+9b+20c=n for a given n. It has code commenting. http://dpaste.com/1327972/

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Latest Questions
MakaylaChuck23: Help wats this
7 hours ago 2 Replies 0 Medals
MakaylaChuck23: uh oh
9 hours ago 1 Reply 0 Medals
Treeko: Pics I took w my friend !
11 hours ago 6 Replies 2 Medals
Aliciaa: Is anyone elses QC going wack? Mine keeps freezing and stuff
9 hours ago 26 Replies 1 Medal
autumnp: does anyone have bandlab?
12 hours ago 4 Replies 0 Medals
Jeromeccv: Art for @vanessad123
9 hours ago 49 Replies 4 Medals
ohhhhhhhhhhhhhh: how do i slim my waist fast
12 hours ago 4 Replies 1 Medal
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!