<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>C# on Shai Asher</title><link>https://slow-is-smooth.io/tags/c%23/</link><description>Recent content in C# on Shai Asher</description><generator>Hugo</generator><language>en-gb</language><lastBuildDate>Sun, 20 Jul 2025 18:54:33 +0000</lastBuildDate><atom:link href="https://slow-is-smooth.io/tags/c%23/index.xml" rel="self" type="application/rss+xml"/><item><title>Solving Pandigital Multiples with C# and Length‑Based Pruning</title><link>https://slow-is-smooth.io/blog/solving-pandigital-multiples-with-c-and-length-based-pruning/</link><pubDate>Sun, 20 Jul 2025 18:54:33 +0000</pubDate><guid>https://slow-is-smooth.io/blog/solving-pandigital-multiples-with-c-and-length-based-pruning/</guid><description>&lt;p&gt;&lt;em&gt;In this post, we’ll explore a C# implementation that finds the largest 1–9 pandigital concatenated product by mathematically pruning the search space based on digit lengths, rather than brute-forcing all possibilities.&lt;/em&gt;&lt;/p&gt;&#10;&lt;hr&gt;&#10;&lt;h2 id="1-the-pandigital-multiples-problem-recap"&gt;1. The Pandigital Multiples Problem Recap&lt;/h2&gt;&#10;&lt;p&gt;We seek the maximum 9‑digit number formed by concatenating the products:&lt;/p&gt;</description></item></channel></rss>