Trace: • strings
wiki:donuts:springsummer2014:answers:strings
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
wiki:donuts:springsummer2014:answers:strings [2014/06/26 23:36] jmb438 |
wiki:donuts:springsummer2014:answers:strings [2014/06/26 23:38] (current) jmb438 |
||
|---|---|---|---|
| Line 18: | Line 18: | ||
| The question remains: what is //N//? | The question remains: what is //N//? | ||
| - | To get this, we simply count the number of crossings for the maximum crossing configuration. We begin by counting the crossings involving the string going between holes 1 and 10. This string crosses every other giving us 9 crossings. Next, we move on to the string between 2 and 9. We've already counted the first string, so we will ignore that string. This give 8 more crossings (see below). Continuing this process, we see that we end up with //9 + 8 + 7 + ... + 1 + 0 = 45 = N// crossings. | + | To get this, we simply count the number of crossings for the maximum crossing configuration. We begin by counting the crossings involving the string going between holes 1 and 10. This string crosses every other giving us 9 crossings. Next, we move on to the string between 2 and 9. We've already counted the first string, so we will ignore it. This give 8 more crossings (see below). Continuing this process, we see that we end up with //9 + 8 + 7 + ... + 1 + 0 = 45 = N// crossings. |
| {{:donutquestions:strings1.png?300|}} | {{:donutquestions:strings1.png?300|}} | ||
wiki/donuts/springsummer2014/answers/strings.1403847416.txt.gz · Last modified: 2014/06/26 23:36 by jmb438