Solving a Diophantine Equation with $4000 and Cows, Lambs & Piglets

  • Thread starter Thread starter lokisapocalypse
  • Start date Start date
lokisapocalypse
Messages
32
Reaction score
0
The question reads:

A farmer purchased 100 head of livestock for a total cost of $4000. Prices were as follow: calves, $120 each; lambs, $50 each; piglets, $25 each. If the farmer obtained at least one animal of each type, how many of each did he buy?

I obtained that -240 < t < -15.789 but this can't be right as there are way too many t's to check them all. Does anyone have a hint or some help?
 
Physics news on Phys.org
Never mind. Amazing how after looking at this problem for 4 hours, I post it here and 20 minutes later I see my mistake.
 
This one is sort of a brute force problem, but it can be simplified. We have X+Y+Z=100, where X=calves, Y=lambs, Z=piglets. Then for the money we have:

120X +50Y + 25Z=4000. This tells us that 5 divides X giving 5X'=X, and 2 divides Z giving 2Z' =Z. Thus form reduces to 12X' + Y+Z' = 80. Modifying the other equation gives 5X'+Y+2Z' =100. We can eliminate Y in one case, and going over the same equations eliminate Z'. Then we can look for more shortcuts or just use trial and error on the cases. Z', can not exceed 6 so there is no more than 6 cases to try.

And be careful about looking for ALL solutions!
 
##\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...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top