Two Plus Two Newer Archives  

Go Back   Two Plus Two Newer Archives > Other Topics > Science, Math, and Philosophy
FAQ Community Calendar Today's Posts Search

Reply
 
Thread Tools Display Modes
  #1  
Old 06-15-2007, 04:04 AM
borisp borisp is offline
Senior Member
 
Join Date: Nov 2004
Posts: 201
Default another interesting but harder problem

Suppose you have a nxn grid of "cells," represented by squares, as on an nxn checkerboard. Some of them are "infected," the rest are not.

If an uninfected cell shares at least two edges with an infected cell, then the uninfected cell becomes infected. This process continues until the set of infected cells stabilizes.

The problem is to prove the following statement, using less than two sentences. (In other words, inductive arguments and computer simulations are unacceptable; the point is to find an elegant solution.)

"If the entire grid is infected at the end of the process, then at least n squares had to be infected to begin with."
Reply With Quote
  #2  
Old 06-15-2007, 04:44 AM
blah_blah blah_blah is offline
Senior Member
 
Join Date: Feb 2007
Posts: 378
Default Re: another interesting but harder problem

I hope this works.

Let p(t) denote the sum of the perimeters of the disjoint polygons formed by the infected squares at time t. p(t) is decreasing in t. If the entire grid is infected at time T (>0), p(T) = 4n. But if less than n squares are infected at the beginning, we have p(0)<=4*{# of initially infected squares}<4n, a contradiction, since p(0) >= p(T).

There probably should be some proof that the grid reaches its final state in time T < infinity, but this is more or less trivial.
Reply With Quote
  #3  
Old 06-15-2007, 04:56 AM
borisp borisp is offline
Senior Member
 
Join Date: Nov 2004
Posts: 201
Default Re: another interesting but harder problem

Holy crap, that is easily the fastest correct solution that I have seen, and I have posed this to many very smart people. You haven't seen this before?

In any event, this is exactly the response I was looking for.
Reply With Quote
  #4  
Old 06-15-2007, 04:59 AM
blah_blah blah_blah is offline
Senior Member
 
Join Date: Feb 2007
Posts: 378
Default Re: another interesting but harder problem

[ QUOTE ]
Holy crap, that is easily the fastest correct solution that I have seen, and I have posed this to many very smart people. You haven't seen this before?

In any event, this is exactly the response I was looking for.

[/ QUOTE ]

it seemed like a natural thing to look at, except that at first I thought that the perimeter of the boundary would be increasing in time. After I tried some small cases and saw that the opposite was in fact true, the proof quickly followed [img]/images/graemlins/smile.gif[/img]
Reply With Quote
  #5  
Old 06-15-2007, 04:59 AM
borisp borisp is offline
Senior Member
 
Join Date: Nov 2004
Posts: 201
Default Re: another interesting but harder problem

...and the finite time follows simply from the pigeonhole principle.
Reply With Quote
  #6  
Old 06-15-2007, 05:03 AM
blah_blah blah_blah is offline
Senior Member
 
Join Date: Feb 2007
Posts: 378
Default Re: another interesting but harder problem

[ QUOTE ]
...and the finite time follows simply from the pigeonhole principle.

[/ QUOTE ]

of course, but I was already at three sentences and didn't want to incur your wrath [img]/images/graemlins/smile.gif[/img]. is your solution the same?
Reply With Quote
  #7  
Old 06-15-2007, 05:13 AM
borisp borisp is offline
Senior Member
 
Join Date: Nov 2004
Posts: 201
Default Re: another interesting but harder problem

I accept any answer that involves "perimeter" and "nondecreasing" [img]/images/graemlins/smile.gif[/img]
Reply With Quote
  #8  
Old 06-15-2007, 05:15 AM
borisp borisp is offline
Senior Member
 
Join Date: Nov 2004
Posts: 201
Default Re: another interesting but harder problem

er, nonincreasing, but if you've solved it, you know what i mean
Reply With Quote
Reply


Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT -4. The time now is 11:47 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.