|
|
|
|
| View previous topic :: View next topic |
| Author |
Message |
thatsmyusername
Icarian Member
|
Posted: Wed Jan 27, 2010 12:33 pm Post subject: 1 |
|
|
http://www.mathpuzzle.com/krauspuz.html
| Quote: |
3. MATH CLASS
A high school math teacher chose three of his best students to conduct a little experiment. He said, "I have chosen a three-digit number, N, with the first digit not more than the second and the second not more than the third. I also have chosen a function, F(N), which is one of these five functions:
(1) SUM(N) = The Sum of the digits of N.
(2) PROD(N) = The Product of the digits of N.
(3) SSQ(N) = The Sum of the Squares of the digits of N.
(4) SSC(N) = The Sum of the Cubes of the digits of N.
(5) LCM(N) = The Least Common Multiple of the digits of N.
"I then calculated the value, V = F(N), and have written the three items, N, F, V, each on a separate piece of paper and will give one to each of you. You must try to determine the other 2 items not on your paper. You may use your computers, but cannot collaborate. Don't turn in your answers until I ask for them. Don't worry about any unfair disadvantage of which item you get, this is not a competition, only an experiment. Just make your lists and we'll see what happens!"
Here is what happened:
1:00 - Students begin working.
1:20 - Teacher asks if anyone had found the answers. No one had.
1:30 - Teacher asks if anyone had found the answers. No one had.
1:31 - Teacher asks if it would help if he told them if N was odd or even. All 3 say no.
1:40 - Teacher asks if anyone had found the answers. No one had.
1:41 - Teacher asks if it would help if he told them if V was odd or even. All 3 say no.
1:50 - Teacher asks if anyone had found the answers. No one had.
1:51 - Teacher asks if it would help if he told them the sum of N and V. All 3 say no.
2:00 - Teacher asks if anyone had found the answers. All three of them had! |
Can anyone solve this puzzle? |
|
| Back to top |
|
 |
MNOWAX
0.999... of a Troll
|
Posted: Wed Jan 27, 2010 4:48 pm Post subject: 2 |
|
|
I know the answer, so I will allow some of the other GL'ers have a chance.
I have no f'in clue in other words. _________________ The Man The Myth The Legend
MNOWAX |
|
| Back to top |
|
 |
thatsmyusername
Icarian Member
|
Posted: Thu Jan 28, 2010 1:51 am Post subject: 3 |
|
|
Can you maybe give us a hint what it means for the students to reject the hint offers? I tried the "it doesn't help because we already know the answer to that hint" route, for example, but that does not result in a solution.
I also tried the "it actually helps a little bit, but I'd still need more information before I can solve it, so I guess in a short-sighted way that doesn't really help" interpretation, and that got nowhere too.
Also, I'm not sure what the policy is regarding cross-linking to other forums, but if you google search the subject of the thread, you'll see my post discussing this problem elsewhere. |
|
| Back to top |
|
 |
MNOWAX
0.999... of a Troll
|
Posted: Thu Jan 28, 2010 4:04 am Post subject: 4 |
|
|
highlight my entire post, and you'll get a hint on the answer. _________________ The Man The Myth The Legend
MNOWAX |
|
| Back to top |
|
 |
ralphmerridew
Daedalian Member
|
Posted: Thu Jan 28, 2010 11:16 am Post subject: 5 |
|
|
| "would it help?" means "would you be able to answer all three questions?" |
|
| Back to top |
|
 |
Zag
Tired of his old title
|
Posted: Thu Jan 28, 2010 12:34 pm Post subject: 6 |
|
|
| I agree that the question is poorly worded. It isn't even clear to me that the students even are told which envelope they recieved -- they might just have a number! Of course, then I think it is clearly impossible. |
|
| Back to top |
|
 |
3iff
very unbifflike
|
Posted: Thu Jan 28, 2010 12:55 pm Post subject: 7 |
|
|
For the original page, it's posed as a logic problem...and I'm guessing it must be solvable.
N must be from 111 to 999 with the limitation that subsequent digits being are at least as high as the previous digit.
As they are allowed to use computers, they should be able to calculate which values of N are allowed, and then compute all possible answers for V=F(N). This should allow certain combinations to be eliminated as each person can eliminate possibilities (from their list).
From the "No" answers to the offered hints, each must realise that the others cannot benefit from the hints.
Eventually...there must be a combination of values that are unique. Yes?? |
|
| Back to top |
|
 |
ralphmerridew
Daedalian Member
|
Posted: Thu Jan 28, 2010 2:35 pm Post subject: 8 |
|
|
| If you add in typical assumptions, it become solvable (though some questions turn out to give no information to anyone), and there's a logically invalid method that unfortunately gets the correct answer. |
|
| Back to top |
|
 |
Zag
Tired of his old title
|
Posted: Thu Jan 28, 2010 6:22 pm Post subject: 9 |
|
|
Really, rm?
I've come down to it being one of these combinations
| Code: |
N Operation Value
111 LCM(N) 1
111 PROD(N) 1
567 LCM(N) 210
567 PROD(N) 210
578 LCM(N) 280
578 PROD(N) 280
579 LCM(N) 315
579 PROD(N) 315
589 LCM(N) 360
589 PROD(N) 360
789 LCM(N) 504
789 PROD(N) 504
|
But I don't see how the two with N and F(N) can tell which operation it is, nor how the guy with the operation can tell which N and F(N) it is.
I did this by making the assumption that any time the teacher asked if odd/even would help, a student would have answered yes if there was any chance that it would give him the answer (but not if it would only have pared down his list). Therefore, any group with even one uniquely odd/even value, then the whole group was eliminated.
So, for example, after the second time the question was asked, this entire group was eliminated, because the person with F(N) would have said yes, because a response of 'even' would have told him the answer. (This is the group of all the possibilities that were remaining at the time, for the person who held the F(N) card, if the value he held was 23.)
| Code: |
599 SUM(N) 23
689 SUM(N) 23
779 SUM(N) 23
788 SUM(N) 23
|
Even if I had used a more aggressive pruning of the list, such that all but one of these pairs had been eliminated, I don't see how anyone but the guy with the 'which function' card could know which function, since it has to be one of those two.
Last edited by Zag on Thu Jan 28, 2010 6:26 pm; edited 1 time in total |
|
| Back to top |
|
 |
ralphmerridew
Daedalian Member
|
Posted: Thu Jan 28, 2010 6:25 pm Post subject: 10 |
|
|
| Check your work. That is not the correct set of possibilities. |
|
| Back to top |
|
 |
Zag
Tired of his old title
|
Posted: Thu Jan 28, 2010 6:29 pm Post subject: 11 |
|
|
| ralphmerridew wrote: |
| Check your work. That is not the correct set of possibilities. |
Sigh. No. I've spent too much time on this already. I knew that there was too much manual operation by me in there, because my spreadsheet-fu is inadequate.
Was that the assumption you used? Or did you assume that, if they said no to the even/odd questions, that it meant that all their range of possibilities were the same even/odd value? (That is, they would have said yes even if it only pared down their list.) |
|
| Back to top |
|
 |
ralphmerridew
Daedalian Member
|
Posted: Thu Jan 28, 2010 6:37 pm Post subject: 12 |
|
|
| I took "would it help?" to mean "would you be able to immediately answer all three questions?". (If I took it to mean "would you be able to prune your list of possibilities?", then somebody would have answered "yes" at 1:31.) |
|
| Back to top |
|
 |
Zag
Tired of his old title
|
Posted: Thu Jan 28, 2010 9:13 pm Post subject: 13 |
|
|
Gaah. I suck at ignoring stuff.
So, rather than Excel, I wrote a Java program to do the analysis. I realized what my mistake was before, but I still end up with both of the choices
| Code: |
N Operation Value
111 LCM(N) 1
111 PROD(N) 1
|
and I don't see how the two with F(N) and N would ever be able to decide between them.
In fact, now that I think about it some more, I must have a mistake in my program, because it can't be either of these two. If those are still available, then the guy who knows which function would have said 'yes' to 'will the sum of N + F(N) help you. Certainly those are the only two for which that sum is 112, so would have been enough for him. Sigh. I really am going to quit on this puzzle this time. |
|
| Back to top |
|
 |
ralphmerridew
Daedalian Member
|
Posted: Thu Jan 28, 2010 9:17 pm Post subject: 14 |
|
|
| Your program was too aggressive in eliminating cases; unless my program was wrong, you eliminated way too many cases. |
|
| Back to top |
|
 |
Zag
Tired of his old title
|
Posted: Thu Jan 28, 2010 9:21 pm Post subject: 15 |
|
|
LOL. Probably.
I wasn't sure with your comment here:
| ralphmerridew wrote: |
| I took "would it help?" to mean "would you be able to immediately answer all three questions?". (If I took it to mean "would you be able to prune your list of possibilities?", then somebody would have answered "yes" at 1:31.) |
whether you meant the same thing I did. Did you assume that the only would have said yes if they were down to exactly two choices, one even one odd, so that an even/odd answer would definitely enable them to answer? Or did you interpret it as I did, which is that any group with a single even or a single odd choice gets thrown out (because the 'correct' even/odd answer would have given them the result)?
(Similarly, in the last question, I removed any group in where there was any unique value.) |
|
| Back to top |
|
 |
ralphmerridew
Daedalian Member
|
Posted: Thu Jan 28, 2010 9:43 pm Post subject: 16 |
|
|
| I'd have to check my program's source, but I'm pretty sure it was "two cases, one with answer yes and one with answer no". |
|
| Back to top |
|
 |
thatsmyusername
Icarian Member
|
Posted: Fri Jan 29, 2010 12:48 am Post subject: 17 |
|
|
| Zag wrote: |
| I agree that the question is poorly worded. It isn't even clear to me that the students even are told which envelope they recieved -- they might just have a number! Of course, then I think it is clearly impossible. |
Oh. My. God. You are absolutely right about the comment in bold. I did not take this into account.
Contrary to your last sentence, I think possibly that fact is what makes the puzzle solvable.
Let me work on this some more... |
|
| Back to top |
|
 |
ralphmerridew
Daedalian Member
|
Posted: Fri Jan 29, 2010 1:01 am Post subject: 18 |
|
|
| Well, I found a solution assuming that students do know which envelope they have. |
|
| Back to top |
|
 |
thatsmyusername
Icarian Member
|
Posted: Fri Jan 29, 2010 1:24 am Post subject: 19 |
|
|
So at 1:25 you only have 625 possibilities left? You eliminated [N=899, F=SSQ, V=226] even though a person that sees 226 does not know if that number is N or V?
I already tried that route and I couldn't find a solution, so I'd be curious where you and I differed. I'm still exploring this N/V-ambiguous route. It does look promising. |
|
| Back to top |
|
 |
thatsmyusername
Icarian Member
|
Posted: Fri Jan 29, 2010 1:54 am Post subject: 20 |
|
|
I didn't get anywhere with N/V being ambiguous, however someone at another forum brought up the possibility that F is also given as a number 1..5.
Thus, someone who sees the number "1" in his paper can't tell if that's V or F.
I'd be curious how you claimed to have found a solution without these seemingly-forced complexities where all others have failed. Would you care to just explain and spoil it for us? |
|
| Back to top |
|
 |
Zag
Tired of his old title
|
Posted: Fri Jan 29, 2010 3:30 am Post subject: 21 |
|
|
I got pretty close, and rm is a lot smarter than I am. You should be less suspicious.
Anyway, I don't see how making things more ambiguous would make it more solvable. |
|
| Back to top |
|
 |
thatsmyusername
Icarian Member
|
Posted: Fri Jan 29, 2010 3:52 am Post subject: 22 |
|
|
| Well, I was hoping that making a number ambiguous between N and V would preserve triples that may later turn out to be unique at 2:00 (and therefore is the solution). |
|
| Back to top |
|
 |
thatsmyusername
Icarian Member
|
Posted: Fri Jan 29, 2010 4:19 am Post subject: 23 |
|
|
OK I'm going to detail how far I'd get if:
- I assume that envelopes are clearly labeled (so to speak)
- A hint is only "helpful" if it allows them to immediately single-out the solution
After 1:00 - 825 possibilities
After 1:20 - 625 left, 200 removed because V would've solved it
After 1:30 - 625 left ("wasted" round)
After 1:31 - 585 left, 40 removed because V + hint would've solved it
After 1:40 - 584 left, [899, LCM, 72] would've been solvable by N
After 1:41 - 572 left, 12 removed because N + hint would've solved it
After 1:50 - 572 left ("wasted" round)
After 1:51 - 113 left (374/180/204 would've been solvable by N/F/V + hint)
Among these 113, no unique value in N, F, or V.
Comments? |
|
| Back to top |
|
 |
ralphmerridew
Daedalian Member
|
Posted: Fri Jan 29, 2010 2:55 pm Post subject: 24 |
|
|
Well, I checked my source and found that my program actually used the rule of "Teacher told them 'None of you would be able to solve it given that information.'".
I found the author's orignal site, and my answer (derived with completely wrong logic) turned out to be correct. Unfortunately, he only gives the raw answer with no explanation whatsoever, so I don't know what the right explanation is. |
|
| Back to top |
|
 |
Zag
Tired of his old title
|
Posted: Fri Jan 29, 2010 3:39 pm Post subject: 25 |
|
|
| ralphmerridew wrote: |
| Well, I checked my source and found that my program actually used the rule of "Teacher told them 'None of you would be able to solve it given that information.'" |
huh? |
|
| Back to top |
|
 |
ralphmerridew
Daedalian Member
|
Posted: Fri Jan 29, 2010 4:24 pm Post subject: 26 |
|
|
My program essentially treated
Teacher: If I told you ____, would it help?
Students: No.
as if it were:
Teacher: Even if I told you _____, none of you would be able to answer the questions.
So for the case
| Code: |
599 SUM(N) 23
689 SUM(N) 23
779 SUM(N) 23
788 SUM(N) 23 |
the program would eliminate the last case. |
|
| Back to top |
|
 |
Zag
Tired of his old title
|
Posted: Fri Jan 29, 2010 4:55 pm Post subject: 27 |
|
|
| Thanks! That clears it up. I had started with that approach, when I was just doing it manually in Excel, but then realized about three deletes into it that it didn't make sense as the question was worded. I'll bet, though, that it is how the original puzzle author also did it, if you ended up with the same answer he did. There's no reason to think that these puzzle authors are infallible. |
|
| Back to top |
|
 |
lostdummy
Daedalian Member
|
Posted: Sat Jan 30, 2010 10:30 pm Post subject: 28 |
|
|
Just noticed there are some new problems on forum, and tried this one - but my first fast attempt did not exactly solve it ;p
I remain with 2 possible solutions for each of them:
1:00 - Students begin working. Remains 825
1:20 - Teacher asks if anyone had found the answers. No one had. Remains 625
1:31 - Teacher asks if it would help if he told them if N was odd or even. All 3 say no. Remains 459
1:41 - Teacher asks if it would help if he told them if V was odd or even. All 3 say no. Remains 380
1:51 - Teacher asks if it would help if he told them the sum of N and V. All 3 say no. Remains 4
Which leaves 4 possible cases:
[242]: N=279 , F=PROD(N) , V=126
[254]: N=345 , F=PROD(N) , V=60
[737]: N=279 , F=LCM(N) , V=126
[749]: N=345 , F=LCM(N) , V=60
Actually, those who get N or V would be able to guess other persons N or V, but since PROD and LCM both result in same numbers here, they wouldn't be able to guess function.
Therefore, since it appears from above posts that there is unique solution here, I wonder which restriction I missed ;p |
|
| Back to top |
|
 |
thatsmyusername
Icarian Member
|
Posted: Sat Jan 30, 2010 10:45 pm Post subject: 29 |
|
|
You pruned too aggressively. The answer is supposed to be SSQ(336)=54, which is one of the 113 possibilities I have left.
How do you go from 625 at 1:20 to 459 at 1:31? Maybe you pruned the 3 columns with sequential dependency instead of in parallel? |
|
| Back to top |
|
 |
lostdummy
Daedalian Member
|
Posted: Sun Jan 31, 2010 12:12 am Post subject: 30 |
|
|
Nope, if anything I pruned too conservatively. And what would be "sequential dependency" anyway in this case?
Take example (with incorrect numbers, just for example) of all remaining combinations for value=6:
1) N=123, F=* , V=6
2) N=123, F=*, V=6
3) N=224, F=*, V=6
After "N+V" question, I presumed that at least 3rd row should be pruned, since if someone holds value of "6", if N+V happened to be 230 it would uniquely define result.
With that I get 4 results remaining after N+V step - those that i listed above.
BUT this SHOULD be even more aggressively pruned, since in above example anyone with value "6" would answer YES to "N+V" question (if answer/hint happen to be N+V=230 it solves problem, so it "would help").
With such pruning (and i consider it more logical than above example) I remain with NO SOLUTION possible, that is to say, after N+V question number of remaining possibilities is 0(Zero) .
I noticed that RM mentioned considering "would help" as something along "even if i tell you , it wont help you". While that is much different from stated problem, since then teacher use information that only he knows, it is close to above example when I remain with 4 solutions. There, I prune only 3rd row, comparable to considering that teacher would know it would help them to get N+V if someone had 3rd row. |
|
| Back to top |
|
 |
lostdummy
Daedalian Member
|
Posted: Sun Jan 31, 2010 12:55 am Post subject: 31 |
|
|
I find that even if I skip all other questions, and only use that "N+V" question, I have same two solutions:
a) if i interpret question as "even if i told you N+V, it wouldnt help you", I get results that I posted above
b) if i interpret it as "students who MIGHT benefit from N+V (if it happen to be certain value) would answer YES", then problem does not have solution - 0 remains possible.
BTW, is there any proof for SSQ(336)=54 ?
Doing quick analysis only from N+V question, it goes like this:
1) at start we have (among those 825 combinations):
2x (F=SSQ=3) and (N+V=390) :
N=269 , F=3 , V=121
N=336 , F=3 , V=54
1x (N=269) and (N+V=390):
N=269 , F=3 , V=121
2) if someone had N=269 and teacher told that "N+V=390", he would immediately know solution (other two numbers are 3 and 121). So combination "N=269 , F=3 , V=121" is removed from possible solutions
3) now we have only one combination with (F=SSQ=3) and (N+V=390) :
N=336 , F=3 , V=54
Since teacher knew that if he told 390, after step2 it would pinpoint only remaining possible solution, he could not say that "N+V would not help" - therefore we must remove also "N=336 , F=3 , V=54" as possible solution.
That means solution SSQ(336)=54 get removed after only 2 steps if "N+V" question is considered as "Teacher: it would not help you even if i tell you N+V". And so far that interpretation of "would help" is best that I can see, since it leaves us with 4 possible solutions, while more logical interpretation (b) leaves us with no possible solutions at all. |
|
| Back to top |
|
 |
lostdummy
Daedalian Member
|
Posted: Sun Jan 31, 2010 5:19 am Post subject: 32 |
|
|
ok, I think i have one interpretation where I can get single solution.
If "would it help" is considered to be "even if i tell you N+V, you still would not be able to solve problem without additional question/info" then it can be solved. That "without additional question/info" means they could not be certain what is solution unless next "do you have answer" question is asked.
That would prevent "recursive" removing of possible solutions, and will result in 14 possible solutions after "N+V" question:
N=118 , F=2 , V=8
N=235 , F=2 , V=30
N=279 , F=2 , V=126
N=345 , F=2 , V=60
N=336 , F=3 , V=54
N=117 , F=5 , V=7
N=119 , F=5 , V=9
N=137 , F=5 , V=21
N=157 , F=5 , V=35
N=179 , F=5 , V=63
N=235 , F=5 , V=30
N=279 , F=5 , V=126
N=345 , F=5 , V=60
N=358 , F=5 , V=120
Out of those, only one combination will enable all 3 of them to say "I know answer" on last question, and that is "N=336 , F=3 , V=54" |
|
| Back to top |
|
 |
|
|
You cannot post new topics in this forum You can reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum
|
Powered by phpBB © 2001, 2005 phpBB Group
|
|