<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>permutations on Ciência Programada</title>
    <link>https://cienciaprogramada.com/tags/permutations/</link>
    <description>Recent content in permutations 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, 14 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://cienciaprogramada.com/tags/permutations/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>Permutations with Repetition: When Elements Repeat</title>
      <link>https://cienciaprogramada.com/2026/07/permutations-with-repetition/</link>
      <pubDate>Tue, 14 Jul 2026 00:00:00 +0000</pubDate>
      <author>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</author>
      <guid>https://cienciaprogramada.com/2026/07/permutations-with-repetition/</guid>
      <description>How many anagrams does the word MAMBEMBE have? Fewer than an 8-letter word with distinct letters would have, because swapping two equal letters does not create a new anagram. The formula discounts the repetitions by dividing by factorials, and it works for binary sequences and for shortest paths on grids.</description>
      <media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://cienciaprogramada.com/2026/07/permutations-with-repetition/featured_0085.webp" />
    </item>
    
    <item>
      <title>Simple and Circular Permutations</title>
      <link>https://cienciaprogramada.com/2026/07/permutations/</link>
      <pubDate>Thu, 02 Jul 2026 00:00:00 +0000</pubDate>
      <author>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</author>
      <guid>https://cienciaprogramada.com/2026/07/permutations/</guid>
      <description>How many anagrams does the word VIRUS have? In how many ways can 5 friends sit around a table? The answers are 120 and 24, by simple and circular permutations. We will also see adjacency restrictions, the traveling salesman problem, and derangements.</description>
      <media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://cienciaprogramada.com/2026/07/permutations/featured_0082.webp" />
    </item>
    
  </channel>
</rss>
