It looks like you're new here. If you want to get involved, click one of these buttons!
Tonight on GeekNights, we consider that most basic of basics: the humble log file. In the news, Geohot is fighting the good fight, and is the financial world siphoning off all of the world's talent?
Comments
I'll post the quote if no one knows it.
The smallest shape that will make the snake hit itself without going straight is RRR/LLL, or three of the same turn in a row.
The next smallest is the outline of a plus shape (RLLRLLRLLRL) or its inverse, or a reflection of either. However, this requires 11 joints, so any combination is good as long as it doesn't have 3 of the same turn in a row.
I worked out the simple values and got the following results:
1: 2
2: 4
3: 6
4: 1
5: 16
6: 26
This appears to follow a Fibonacci-style sequence, so I extrapolated the following answers:
7: 42
8: 68
9: 110
10: 178
I don't have a proof that that's the right pattern yet, but I recently did a similar problem (find the number of intergers <2<sup>n whose binary expansions don't have two adjacent 1s) and it had a similar answer, so I'm feeling confident. I will try to work out a proof, though.
I'm not even going to try solving it if they can be straight right now, that's much harder.
Let's assume that the last joint on n-1 is R. The next joint (the last one of n) can always be L, so you have f(n-1) possibilities. The next joint can be an R instead if the second to last joint was an L; otherwise it would form RRR. There are f(n-2) possibilities in which the second to last joint is L, so the total is f(n-1) + f(n-2). Thus:
f(n) = f(n-1) + f(n-2)
f(1) = 2
f(2) = 4
This will work for anything up to 10 joints, after that you run into more problems.
RRLRRLRRLRR
RLRRLRRLRRL
LRRLRRLRRLR
and the same ones with the Rs and Ls swapped.
Alternatively:
A complete plus sign is cyclic, consisting of 12 joints of the form 4(RRL) or 4(LLR). There are 3 distinct ways to take a single joint out of such a cycle in order to make an 11-joint snake, and we have 3*2 = 6.
I'd say that f(11) = 178 + 110 - 6 = 282
Consider this 15-joint configuration:
RLR LLRLLR LR LLR L
Or, as a 16-joint cycle:
2(2(LLR)LR)
or
2(2(RRL)RL)
There are 8 distinct places to break one of these cycles, and so there are at least 16 different 15-joint configurations that crash while making neither a plus sign nor a square.
Emily went to film school, she now works on videogames and is learning programming, Rym went to tech school, he is learning film.
Let me set the scene.
I work as a junior systems administrator for the Information Systems department in the College of Engineering and Computer Science at Cal State Northridge. My official title is student assistant, but I do just about everything any of my seniors in the deparment do as well as the majority of the manual labor, but I digress.
About three for four weeks ago, we started having problems with Casper (WindowsServer2008), our Symantec Ghost Console server and department software repository for our college. Some of the disk images for used for imaging the lab computers were coming up corrupted, software installs were having problems, and in general, Casper was acting sluggish. Martin (name changed), my direct supervisor, is in charge of the managment of Casper. Me, along with everyone else in the office, have been on his back about the state of Casper for a while now, but he hadn't done a thing about it. Finally, the most important image on the server became corrupted and shortly after, the server went down.
NOW he looked at it. After a week of being holed up in the server room he got it back online, but neither he, nor any of my other superiors could figure out what was wrong. Finally, Casper stopped responding and went down again and wouldn't come back up. User support type servers (like print and exchange) aside, Casper is the most important server in our server room. This was a major problem. Martin was out for the week, so I told the next person up, the boss of our whole department, that I was fed up and going to take a look myself. It should be noted that one of the big reasons I was hired was for my unconventional thinking and my ability to come up with new solutions to strange problems.
So I head up to the server room, pull out the KVM drawer, and power cycle Casper. Casper is a six or eight U HP server with a five or six disk raid array, so we are used to it taking a long time to boot. A half hour is the norm. I went to go get lunch and hour later, it was just finishing booting up.
That fucker felt shaky as hell, but I managed to log in and pull up the management console. I look through the system logs at the points of the two failures. Apparently, the raid array had reported a critical error with one of the disks and halted the system. On top of that, all logical drives on the raid were fragmented above 70%. So, I went back downstairs and explained what was up and told him what disk they needed to replace. He asked me how I knew and when I told him, he acted like he must have missed it, but from what he was saying, it was clear that he didn't even know WHERE THE FUCKING LOGS WERE.
*Sigh* Sometimes I get the feeling I'm over qualified for this job. Or at least this title and paygrade.
EDIT: What is that tool for viewing the windows kernel logs?
Actually, you may want to look at all the Windows Sysinternals utilities. Lots of useful stuff there in general.