mersenneforum.org August 2015
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2015-07-28, 18:01 #1 R. Gerbicz     "Robert Gerbicz" Oct 2005 Hungary 2·13·53 Posts August 2015 The problem is out... https://www.research.ibm.com/haifa/p...ugust2015.html "Challenge: 02/08/2015 @ 12:00 PM EST" This time is clearly wrong. (in the past it was also wrong, in general came out earlier, there should be a much better policy on this) Note that the July problem is still living! Last fiddled with by R. Gerbicz on 2015-07-28 at 18:03 Reason: grammar
2015-07-29, 02:46   #2
axn

Jun 2003

110748 Posts

Quote:
 Originally Posted by R. Gerbicz The problem is out... https://www.research.ibm.com/haifa/p...ugust2015.html
Shouldn't there be a length for the string? Otherwise, how many points are you going to give?

Also, maybe some restriction on the values of the coordinates? Otherwise it would be trivially solvable (straight line).

2015-07-29, 04:18   #3
R. Gerbicz

"Robert Gerbicz"
Oct 2005
Hungary

2×13×53 Posts

Quote:
 Originally Posted by axn Shouldn't there be a length for the string? Otherwise, how many points are you going to give? Also, maybe some restriction on the values of the coordinates? Otherwise it would be trivially solvable (straight line).
OK, you are tricky. So to restrict the problem:
find a simple, closed polygonal chain (ref. https://en.wikipedia.org/wiki/Polygonal_chain), so p[0],p[1],...,p[n], where
p[i]==p[j] if and only if i=0,j=n or i=n,j=0. And n>1, the rest is the same p[i] is an integer point in 3D, in p[0],p[1],..,p[n] each (consecutive!) pair differs in exactly one coordinate and all three projections should be loop-free.

(You can see that you can get these simple closed polygonal chains by folding a loop.)

There is no given length for the string, so you can use any (finite) value of n. And no restriction for the coordinate values.

Last fiddled with by R. Gerbicz on 2015-07-29 at 04:19

 2015-07-29, 04:54 #4 axn     Jun 2003 110748 Posts Missed the "loop of string" bit. So basically, starting point = end point.
 2015-07-29, 14:03 #5 KangJ   Jul 2015 32 Posts I saw August 2015 problem yesterday, and I tried to solve the problem with many different ways. However, I could not figure out the solution. If the loop is divided by two parts arbitrarily, then the two parts should be connected by at least two line segments. In that case, I think that the two line segments always make a loop on at least one projection plane. Therefore, I think that I misunderstood something... How can I get close to the solution?
 2015-08-01, 03:13 #6 KangJ   Jul 2015 910 Posts Never mind. It was tricky and I solved.
 2015-09-04, 12:02 #7 Xyzzy     "Mike" Aug 2002 3×2,531 Posts
 2015-09-04, 13:18 #8 R. Gerbicz     "Robert Gerbicz" Oct 2005 Hungary 2×13×53 Posts My sent solution was: "One solution: [0,1,2],[0,0,2],[1,0,2],[1,1,2],[1,2,2],[0,2,2],[0,2,1],[1,2,1],[2,2,1],[2,2,2],[2,1,2],[2,1,1],[2,1,0],[2,2,0],[1,2,0],[1,1,0],[1,0,0],[2,0,0],[2,0,1],[1,0,1],[0,0,1],[0,0,0],[0,1,0],[0,1,1],[0,1,2] To see the solution in Mathematica use: Graphics3D[{Thick, Line[{{0,1,2},{0,0,2},{1,0,2},{1,1,2},{1,2,2},{0,2,2}, {0,2,1},{1,2,1},{2,2,1},{2,2,2}, {2,1,2},{2,1,1},{2,1,0},{2,2,0}, {1,2,0},{1,1,0},{1,0,0},{2,0,0}, {2,0,1},{1,0,1},{0,0,1},{0,0,0}, {0,1,0},{0,1,1},{0,1,2} }]}] This was also a recent problem on Komal, see http://www.komal.hu/verseny/feladat....at&f=A638&l=hu The book's picture shows the projections, one can easily verify that these projections are loop-free, so contains no cycle." ps. for the English version see: http://www.komal.hu/verseny/feladat....at&f=A638&l=en (but it does not show the picture), there was only one solver on the competetion (it was on the math section), pretty hard problem.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post Batalov Puzzles 15 2017-09-05 03:47 Xyzzy Puzzles 2 2014-11-02 19:04 fivemack Factoring 76 2010-11-06 11:36 Wacky NFSNET Discussion 0 2007-08-09 02:32 dswanson Lounge 10 2003-08-27 22:48

All times are UTC. The time now is 11:46.

Sun Aug 9 11:46:52 UTC 2020 up 23 days, 7:33, 3 users, load averages: 1.99, 2.04, 1.96

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.