<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Maths on Andrey's Notes on Everything</title><link>https://blog.dmitriev.de/math/</link><description>Recent content in Maths on Andrey's Notes on Everything</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 20 May 2026 15:57:02 +0200</lastBuildDate><atom:link href="https://blog.dmitriev.de/math/index.xml" rel="self" type="application/rss+xml"/><item><title>Build and explore Epipolar Consistency of X-Ray Images</title><link>https://blog.dmitriev.de/math/epi-polar/epi-polar-build/</link><pubDate>Wed, 20 May 2026 00:00:00 +0000</pubDate><guid>https://blog.dmitriev.de/math/epi-polar/epi-polar-build/</guid><description>&lt;p>Just notes about Epipolar Consistency of X-Ray Images&lt;/p></description></item><item><title>Finding the Remainder of \(9^{2018} \mod 7\) - Understanding Modular Patterns</title><link>https://blog.dmitriev.de/math/pow-mod/</link><pubDate>Wed, 20 May 2026 00:00:00 +0000</pubDate><guid>https://blog.dmitriev.de/math/pow-mod/</guid><description>&lt;p>When you first see an expression like&lt;/p>
\[
9^{2018} \mod 7,
\]&lt;p>it looks impossible to compute. The number \(9^{2018}\) is unimaginably large — far beyond what any calculator can display.&lt;/p>
&lt;p>Fortunately, modular arithmetic has a wonderful property: &lt;strong>even enormous powers often fall into small repeating cycles&lt;/strong>. Once you notice the pattern, the problem becomes surprisingly simple.&lt;/p>
&lt;p>This post walks you through the reasoning step by step.&lt;/p></description></item></channel></rss>