Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #10072

Re: on solving recurrences

From David Brown <david.brown@hesbynett.no>
Newsgroups comp.programming
Subject Re: on solving recurrences
Date 2019-07-16 09:32 +0200
Organization A noiseless patient Spider
Message-ID <qgjuin$f5f$1@dont-email.me> (permalink)
References (4 earlier) <86pnmbf9jq.fsf@dev.null> <qgijrm$k6$1@dont-email.me> <865zo3aslz.fsf@dev.null> <qgit1t$qam$1@dont-email.me> <86v9w39bff.fsf@toledo.com>

Show all headers | View raw

On 16/07/2019 00:32, Daniel Bastos wrote:

> I'm definitely not disputing that.  The argument in the example
> presented in not spotting a pattern.  It writes equations and adds them
> up and arrives at a conclusion.  Perfectly valid as far as I can see.
> I'll be thankful if you can expose the flaw.  Thanks!
> 

I really don't want to sound patronising here, but do you understand
what "proof by induction" means, and how it works?  If so, then I think
you will quickly see the point, and how to turn this technique into a
proof.  If not, then I am not going to be able to show you it in a few
Usenet posts - but I think you should have no problem learning about it
from some web tutorial.  (Wikipedia is often a good starting point for
some maths topics, but can sometimes be a bit too technical.)

"Proof by induction" gives you the step to go from "I see the pattern
here from expanding a few times" to "I know it always works for all
cases."  It fixes the flaw in your argument - the missing /proof/ that
the generalisation works.

Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

on solving recurrences Daniel Bastos <dbastos@toledo.com> - 2017-03-21 16:13 -0300
  Re: on solving recurrences Ed Prochak <edprochak@gmail.com> - 2017-03-22 06:35 -0700
    Re: on solving recurrences Daniel Bastos <dbastos@toledo.com> - 2017-03-23 19:06 -0300
      Re: on solving recurrences Daniel Bastos <dbastos@toledo.com> - 2017-03-23 19:16 -0300
        Re: on solving recurrences David Brown <david.brown@hesbynett.no> - 2017-03-24 09:53 +0100
  Re: on solving recurrences David Brown <david.brown@hesbynett.no> - 2017-03-22 14:58 +0100
    Re: on solving recurrences Daniel Bastos <dbastos@toledo.com> - 2017-03-23 19:11 -0300
      Re: on solving recurrences David Brown <david.brown@hesbynett.no> - 2017-03-24 09:48 +0100
    Re: on solving recurrences Daniel Bastos <dbastos@toledo.com> - 2019-07-10 11:29 -0300
      Re: on solving recurrences David Brown <david.brown@hesbynett.no> - 2019-07-10 17:25 +0200
        Re: on solving recurrences Robert Girault <r@dev.null> - 2019-07-15 15:16 -0300
          Re: on solving recurrences David Brown <david.brown@hesbynett.no> - 2019-07-15 21:23 +0200
            Re: on solving recurrences Daniel Bastos <dbastos@toledo.com> - 2019-07-15 18:35 -0300
              Re: on solving recurrences David Brown <david.brown@hesbynett.no> - 2019-07-16 00:00 +0200
                Re: on solving recurrences Daniel Bastos <dbastos@toledo.com> - 2019-07-15 19:32 -0300
                Re: on solving recurrences David Brown <david.brown@hesbynett.no> - 2019-07-16 09:32 +0200
                Re: on solving recurrences Daniel Bastos <dbastos@toledo.com> - 2019-07-16 11:40 -0300
                Re: on solving recurrences David Brown <david.brown@hesbynett.no> - 2019-07-16 17:36 +0200
                Re: on solving recurrences Horizon68 like Menz <cdalten@gmail.com> - 2019-07-17 05:15 -0700

csiph-web