took a few tries using trial and error, but i think i got it..
the father has 100 horses.
he gives the first child 1 horse, which would leave him with 99, then he also gives the first child 1/11 of the remainder, which would be 9. that leaves him with 90 horses.
then, he gives the second child 2 horses, leaving him with 88. 1/11 of 88 is 8, so the father is left with 80 horses.
the third child will get 3 horses, leaving the remainder of horses at 77. the 3rd child will also then get 7 horses, so the father is left with 70.
and so on..
if you need to know how many kids he has...
the father starts with 100 horses, and each child gets 10 horses following the pattern, so he has 10 kids.
hope that helped!
2007-05-25 16:04:10
·
answer #1
·
answered by drmd119 2
·
3⤊
0⤋
Even if we know how many children he has there is still no answer here. 1/11 of the remaining could be 1 of 11, 2 of 22, 3 of 33 and so on. Even this assumes that the remaining horses can be divided evenly with no remainder.
2007-05-25 16:02:59
·
answer #2
·
answered by daweaves68 3
·
0⤊
0⤋
He has 67 horeses the way i did that is
1 1/11+ 2 1/11+3 1/11+ 4 1/11+ 5 1/11+ 6 1/11+ 7 1/11+ 8 1/11+ 9 1/11 10 1/11 11 1/11= 66 11/11= 67, he also has 11 kids.
But also give more info next time please.
2007-05-25 16:01:05
·
answer #3
·
answered by Emma Rose 3
·
0⤊
0⤋
If you start off with X horses, you can determine that after n children, the following equation holds.
X = 1 + 2/a + 3/a^2 + ... + n/a^(n-1)
where a = 10/11
You only get an integer for X when you get to n = 10.
X = 100.
2007-05-25 16:18:52
·
answer #4
·
answered by Dr D 7
·
3⤊
0⤋
a million+a million=2 in addition to, somebody with a ways too plenty time on their palms desperate to tutor it... "The evidence starts off from the Peano Postulates, which define the organic numbers N. N is the smallest set pleasing those postulates: P1. a million is in N. P2. If x is in N, then its "successor" x' is in N. P3. there is not any x such that x' = a million. P4. If x isn't a million, then there's a y in N such that y' = x. P5. If S is a subset of N, a million is in S, and the implication (x in S => x' in S) holds, then S = N. then you definately would desire to define addition recursively: Def: permit a and b be in N. If b = a million, then define a + b = a' (making use of P1 and P2). If b isn't a million, then permit c' = b, with c in N (making use of P4), and define a + b = (a + c)'. then you definately would desire to define 2: Def: 2 = a million' 2 is in N via P1, P2, and the definition of two. Theorem: a million + a million = 2 evidence: Use the 1st area of the definition of + with a = b = a million. Then a million + a million = a million' = 2 Q.E.D. observe: there is an determination formula of the Peano Postulates which replaces a million with 0 in P1, P3, P4, and P5. then you definately would desire to alter the definition of addition to this: Def: permit a and b be in N. If b = 0, then define a + b = a. If b isn't 0, then permit c' = b, with c in N, and define a + b = (a + c)'. you in addition to mght would desire to define a million = 0', and 2 = a million'. Then the evidence of the thought above is somewhat distinctive: evidence: Use the 2nd area of the definition of + first: a million + a million = (a million + 0)' Now use the 1st area of the definition of + on the sum in parentheses: a million + a million = (a million)' = a million' = 2 Q.E.D." Wow, he would desire to be a actual hit with the ladies...!! :)
2016-11-05 10:08:39
·
answer #5
·
answered by ? 4
·
0⤊
0⤋
Well first you need to know how many children the father had but 'till the 3rd child I think its 6 horses
2007-05-25 15:53:28
·
answer #6
·
answered by Ana 1
·
0⤊
1⤋
11?
2007-05-25 15:51:29
·
answer #7
·
answered by trudi100 4
·
0⤊
1⤋
How many children does the father have?
2007-05-25 15:51:31
·
answer #8
·
answered by decoyname4t 2
·
0⤊
1⤋
6 is my guess i think u need more info tho
2007-05-25 15:56:43
·
answer #9
·
answered by Lyra H 2
·
0⤊
0⤋
I used to be able to do this, but now I forgot.
2007-05-25 15:45:41
·
answer #10
·
answered by xinnybuxlrie 5
·
0⤊
4⤋