<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>recurrence on Ciência Programada</title>
    <link>https://cienciaprogramada.com/tags/recurrence/</link>
    <description>Recent content in recurrence on Ciência Programada</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <managingEditor>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</managingEditor>
    <webMaster>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</webMaster>
    <copyright>© 2026 Francisco Bustamante</copyright>
    <lastBuildDate>Thu, 25 Jun 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://cienciaprogramada.com/tags/recurrence/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>Recurrence Relations: Defining Sequences in Terms of Themselves</title>
      <link>https://cienciaprogramada.com/2026/06/recurrence-relations/</link>
      <pubDate>Thu, 25 Jun 2026 00:00:00 +0000</pubDate>
      <author>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</author>
      <guid>https://cienciaprogramada.com/2026/06/recurrence-relations/</guid>
      <description>How many moves does it take to solve the Tower of Hanoi? The answer comes from a recurrence relation, which writes the problem in terms of itself with one disk fewer. We set up recurrences and solve them by substitution, by the characteristic equation and by the Master Theorem, used for merge sort.</description>
      <media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://cienciaprogramada.com/2026/06/recurrence-relations/featured_0079.webp" />
    </item>
    
    <item>
      <title>From Base Case to Infinity: An Introduction to Induction and Recurrence</title>
      <link>https://cienciaprogramada.com/2026/06/from-base-case-to-infinity/</link>
      <pubDate>Wed, 17 Jun 2026 00:00:00 +0000</pubDate>
      <author>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</author>
      <guid>https://cienciaprogramada.com/2026/06/from-base-case-to-infinity/</guid>
      <description>How do you prove a formula holds for every natural number, if there are infinitely many of them? With mathematical induction. This introduction maps out the series: classic induction, strong induction and recurrence relations, from Fibonacci to the Tower of Hanoi.</description>
      <media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://cienciaprogramada.com/2026/06/from-base-case-to-infinity/featured_0076.webp" />
    </item>
    
    <item>
      <title>Discrete Mathematics: Introduction and Roadmap</title>
      <link>https://cienciaprogramada.com/2026/06/discrete-mathematics-introduction-roadmap/</link>
      <pubDate>Thu, 04 Jun 2026 00:00:00 +0000</pubDate>
      <author>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</author>
      <guid>https://cienciaprogramada.com/2026/06/discrete-mathematics-introduction-roadmap/</guid>
      <description>In how many ways can you choose a valid password? What is the shortest path between two cities? These are questions of discrete mathematics. This roadmap introduces the site&amp;rsquo;s four series on the topic: sets, induction and recurrence, combinatorics, and graphs, with 28 articles.</description>
      <media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://cienciaprogramada.com/2026/06/discrete-mathematics-introduction-roadmap/featured_0072.jpg" />
    </item>
    
  </channel>
</rss>
