Solving Diophantine Equations: Find Largest Number of Chicken Nuggets

  • Thread starter Thread starter InsaneMind
  • Start date Start date
InsaneMind
Messages
1
Reaction score
0
So the other day I was asked a question about a problem by a friend. Having not been active in a math class in a VERY VERY long time I struggled with it at first... I believe it was worded as such...

Nick goes to McDonald's to buy chicken nuggets. Nick can only buy chicken nuggets in sets of 6, 9 and 20. After a bit, nick tries to figure out what's the largest number of chicken nuggets nick "cannot" buy. Help nick find out his answer, you can use any method you like (including guess and check)


Now originally I recognized that the problem is...

6a + 9b + 20c = n

Which I remembered as a diophantine equation, however I couldn't remember the formula to solve the problem. So I began using the guess and check method and arrived at the appropriate answer...checked his teachers guide to verify and then showed him how I did my guess and check method. His teacher gave out points to students whether they attempted the problem or not as long as they provided substantial work into it and/or arrived at an answer. (Basically as long as he tried he would get the extra-credit...I wish I had that teacher back in the day).


My question is...what's the proper formula for finding the answer?


The answer was 43
 
Physics news on Phys.org
I read about this problem some time back before. I don't think it has anything to do with Diophantine equation, it's more of modulo arithmetic. Except I can't recall the reasoning too.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top