MESSAGE
| DATE | 2015-02-28 |
| FROM | Ruben Safir
|
| SUBJECT | Subject: [LIU Comp Sci] Re: [NYLXS - HANGOUT] Read the FUCKING NOTES
|
From owner-learn-outgoing-at-mrbrklyn.com Sat Feb 28 22:44:48 2015
Return-Path:
X-Original-To: archive-at-mrbrklyn.com
Delivered-To: archive-at-mrbrklyn.com
Received: by mrbrklyn.com (Postfix)
id 843941612FE; Sat, 28 Feb 2015 22:44:48 -0500 (EST)
Delivered-To: learn-outgoing-at-mrbrklyn.com
Received: by mrbrklyn.com (Postfix, from userid 28)
id 6F22C161301; Sat, 28 Feb 2015 22:44:48 -0500 (EST)
Delivered-To: learn-at-nylxs.com
Received: from mailbackend.panix.com (mailbackend.panix.com [166.84.1.89])
by mrbrklyn.com (Postfix) with ESMTP id 823AF1612FE;
Sat, 28 Feb 2015 22:44:46 -0500 (EST)
Received: from panix2.panix.com (panix2.panix.com [166.84.1.2])
by mailbackend.panix.com (Postfix) with ESMTP id 9900310CF6;
Sat, 28 Feb 2015 22:44:45 -0500 (EST)
Received: by panix2.panix.com (Postfix, from userid 20529)
id 7EF3233C79; Sat, 28 Feb 2015 22:44:45 -0500 (EST)
Date: Sat, 28 Feb 2015 22:44:45 -0500
From: Ruben Safir
To: hangout-at-nylxs.com
Cc: learn-at-nylxs.com
Subject: [LIU Comp Sci] Re: [NYLXS - HANGOUT] Read the FUCKING NOTES
Message-ID: <20150301034445.GA17621-at-panix.com>
References: <54F0E220.5010209-at-panix.com>
<20150228000724.5894291.2924.3651-at-gmail.com>
<20150228002042.5894291.22419.3653-at-gmail.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <20150228002042.5894291.22419.3653-at-gmail.com>
User-Agent: Mutt/1.5.23 (2014-03-12)
Sender: owner-learn-at-mrbrklyn.com
Precedence: bulk
Reply-To: learn-at-mrbrklyn.com
On Fri, Feb 27, 2015 at 07:20:42PM -0500, prmarino1-at-gmail.com wrote:
>
> Correction it sounds like a might be a parity calculation???. Again over thinking it only makes sense if you are dealing with 4 or more disks. Mathematically it still sort of works if you can utilize decimals as disk counts but??
>
It is actually the towers of hanoi
and it is a PIA that I really don't understand well. But ths sentence,
at least to me, looks like it is say that
a = 3
b = 4
a == b <<=== TRUE
I'm totally perplexed by the details.
Ruben
> Sent from my BlackBerry 10 smartphone.
> ?? Original Message ??
> From: prmarino1-at-gmail.com
> Sent: Friday, February 27, 2015 19:07
> To: hangout-at-nylxs.com; learn-at-nylxs.com; hangout
> Subject: Re: [NYLXS - HANGOUT] Read the FUCKING NOTES
>
> Umm correct me if I'm wrong ???but 2 to the power of one is 2 so to simplify the first equation 2-1=1. So n=1 is a really bad example.
>
> Beyond that ???off the top of my head it looks like you may be dealing with RAID stripe, and stride equations. In that case I think you are over thinking the problem.
>
> Sent from my BlackBerry 10 smartphone.
> ?? Original Message ??
> From: Ruben Safir
> Sent: Friday, February 27, 2015 16:31
> To: learn-at-nylxs.com; hangout
> Reply To: hangout-at-nylxs.com
> Subject: [NYLXS - HANGOUT] Read the FUCKING NOTES
>
>
> The minimum number of moves required to solve the Towers of Hanoi puzzle
> with n disks is ***2^n ??? 1***.
>
>
> Proof is by mathematical induction:
> Basis: n = 1. Number of moves required is 2^1 ??? 1 = 1.
> Inductive step: Assume result true for n disks. Suppose now n + 1 disks are
> given. In order to move the largest disk from its initial location at
> the bottom
> of pile 1 to the final location at the bottom of pile 3, we clearly need
> to first
> have moved all other disks to pile 2, which by inductive hypothesis
> requires at
> least 2^n ??? 1 moves. Then one move is required to move the largest disk from
> pile 1 to pile 3. Finally at least 2n ??? 1 moves are required to move the
> remaining
> disks from pile 2 to pile 3. So the total number of moves required is at
> least
> (2^n ??? 1) + 1 + (2^n ??? 1) = ***2^(n+1) ??? 1***.
>
>
> What don't i understand hear
>
|
|
