<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <title>Mathematical problems, from fun to challenging</title>
  <link>https://kefalasmath.com/</link>
  <atom:link href="https://kefalasmath.com/feed.xml" rel="self" type="application/rss+xml"/>
  <description>Articles by Kyriakos Kefalas</description>
  <language>en</language>
  <item>
    <title>On Arithmetic Progressions Divisible by a Twin Prime Product</title>
    <link>https://kefalasmath.com/articles/arithmetic-progressions-divisible-by-a-twin-prime-product/</link>
    <guid isPermaLink="true">https://kefalasmath.com/articles/arithmetic-progressions-divisible-by-a-twin-prime-product/</guid>
    <pubDate>Thu, 22 Oct 2026 12:00:00 +0000</pubDate>
    <description>Find ‘clean’ arithmetic progressions (AP) of integers such that all its terms are divisible by a twin prime product. Clean here means that no other integer lying between the terms of the AP, is divisible by a twin prime product.</description>
  </item>
  <item>
    <title>Divisors of, x=2^n+3^n+36^n</title>
    <link>https://kefalasmath.com/articles/divisors-of-x-2-n-3-n-36-n/</link>
    <guid isPermaLink="true">https://kefalasmath.com/articles/divisors-of-x-2-n-3-n-36-n/</guid>
    <pubDate>Tue, 06 Oct 2026 12:00:00 +0000</pubDate>
    <description>Very large integers, sometimes of the order of millions of digits, which are impossible to completely factorize via the known general factorization algorithms. Even partial factorizations are very difficult. For these integers we apply special factorization methods to achieve a partial factorization. The interest lies not only in the prime divisors themselves, but in the methods used.</description>
  </item>
  <item>
    <title>Hidden Integer Factors in a Radical Expression</title>
    <link>https://kefalasmath.com/articles/hidden-integer-factors-in-a-radical-expression-2/</link>
    <guid isPermaLink="true">https://kefalasmath.com/articles/hidden-integer-factors-in-a-radical-expression-2/</guid>
    <pubDate>Mon, 05 Oct 2026 12:00:00 +0000</pubDate>
    <description>We consider algebraic expressions whose values are integers in a specified domain, that can be factored into algebraic factors whose values are also integers. The results are integer divisors of the original integer, although not necessarily prime divisors.</description>
  </item>
</channel>
</rss>
