<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>mathematical proof on Ciência Programada</title>
    <link>https://cienciaprogramada.com/tags/mathematical-proof/</link>
    <description>Recent content in mathematical proof 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>Tue, 23 Jun 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://cienciaprogramada.com/tags/mathematical-proof/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>Strong Induction: When the Step Needs More Context</title>
      <link>https://cienciaprogramada.com/2026/06/strong-induction/</link>
      <pubDate>Tue, 23 Jun 2026 00:00:00 +0000</pubDate>
      <author>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</author>
      <guid>https://cienciaprogramada.com/2026/06/strong-induction/</guid>
      <description>What if the step depends on more than one earlier case, as in Fibonacci? Strong induction assumes all the earlier cases. We will see the technique at work on prime factorization, the chocolate bar, postage stamps and Binet&amp;rsquo;s formula, which in floating point fails from the 71st term on.</description>
      <media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://cienciaprogramada.com/2026/06/strong-induction/featured_0078.webp" />
    </item>
    
    <item>
      <title>Mathematical Induction: Proving Properties for All Natural Numbers</title>
      <link>https://cienciaprogramada.com/2026/06/mathematical-induction/</link>
      <pubDate>Thu, 18 Jun 2026 00:00:00 +0000</pubDate>
      <author>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</author>
      <guid>https://cienciaprogramada.com/2026/06/mathematical-induction/</guid>
      <description>If the first domino falls and each domino knocks over the next, they all fall. That is the logic of the Principle of Mathematical Induction. We will see the structure of the proof (base case, hypothesis and step) in sums, divisibility and inequalities, and the false proof that all horses are the same color.</description>
      <media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://cienciaprogramada.com/2026/06/mathematical-induction/featured_0077.webp" />
    </item>
    
  </channel>
</rss>
