VCE Stuff > VCE Mathematics
Apples
kamil9876:
Unfortunately I'm still in the lead. But good to see progress being made. Maybe from now on we should post strategies along with the numbers just so to see how the ideas improve :)
Basically, we're getting pretty close to my number, but I don't know how close we're getting in terms of ideas which is what I'm more interested in hehe
shinny:
Hmm, probably a fault in my initial assumption then. Basically, I think 666 is the best you can get assuming you use one drop-off point. The table should hopefully make things more clear.
A667B30000020003330100066600999000666Note: sorry I suck at formatting in bbcode D:
Basically, what I'm doing is grabbing 1k of apples, shipping them to the point whilst eating 1 per km, then driving back to A and not eating any apples because he has none on him atm (this is legit right?). You'll see that using 666 as the drop-off yields the same result, basically because these two numbers surround 666.6 recurring, the ideal number to ensure that you have 1000 apples at the drop off point. There's a bit more explanation to why I aimed to get 1000 apples at the drop off point (might be obvious to some of you), but it's redundant anyway if you've beaten 666 kamil =\. Mind sharing what you've got atm?
EDIT: Also works for 333.3 recurring, i.e. 334 and 333. Relies on the same principle really, but using these two numbers leaves 2k at the drop off, which ultimately gives the same answer I got above.
kamil9876:
Yes sorry I forgot to add that if there are no apples in the truck he can drive without eating (I read this problem like four years ago and I was just reminded that it had the word "temptation" in it so that explains that). I didn't see the solution to it though because it was on some Math Genius's blog and there were no solutions lol and I don't think the page is around anymore, and so my answer is not 100% certain but I have heuristically convinced myself that it is.
So far I have 750. I worked that out by working it out for 2000 (since 2000=1000+1000 so only 2 journeys required which is simpler) and then extending that by figuring out what to do with the extra 1000.
Oh and Q2 I just made up myself last night so I am even less certain of that haha. Let's just treat it as a "research question" haha.
shinny:
--- Quote from: kamil9876 on July 02, 2009, 02:05:47 am ---Yes sorry I forgot to add that if there are no apples in the truck he can drive without eating (I read this problem like four years ago and I was just reminded that it had the word "temptation" in it so that explains that). I didn't see the solution to it though because it was on some Math Genius's blog and there were no solutions lol and I don't think the page is around anymore, and so my answer is not 100% certain but I have heuristically convinced myself that it is.
So far I have 750. I worked that out by working it out for 2000 (since 2000=1000+1000 so only 2 journeys required which is simpler) and then extending that by figuring out what to do with the extra 1000.
Oh and Q2 I just made up myself last night so I am even less certain of that haha. Let's just treat it as a "research question" haha.
--- End quote ---
No revealing the magician's secret? ]: Stayed awake just to find out LOL I'll come back tmrw night then.
kamil9876:
Hahaha I'm staying up for /0. He's been at it for over 2hours now on "who's online" :P He shows promise :D
Navigation
[0] Message Index
[#] Next page
[*] Previous page
Go to full version