🎉 [add index.html] Update Ramsey(5,5) challenge with dynamic year calculation

index.html

@@ -1774,7 +1774,7 @@
                 <p>Finding all such graphs, or even determining the maximum n for which they exist, is a famous problem in combinatorics. Most Ramsey numbers are still unknown—we only know upper and lower bounds.</p>
                 <div class="challenge">
                     <strong>${trophyIcon}Open Challenge:</strong> Find a <span class="highlight">Ramsey(5,5) graph with 43 vertices</span>!<br><br>
-                    All 42-vertex Ramsey(5,5) graphs have been found, but it's unknown if a 43-vertex one exists. The lower bound of R(5,5) hasn't been improved since <strong>1989</strong>. Finding just one such graph would be a major breakthrough—35 years in the making!
+                    All 42-vertex Ramsey(5,5) graphs have been found, but it's unknown if a 43-vertex one exists. The lower bound of R(5,5) hasn't been improved since <strong>1989</strong>. Finding just one such graph would be a major breakthrough—${new Date().getFullYear() - 1989} years in the making!
                 </div>
                 <p>For the latest research on Ramsey graphs, see <strong>Radziszowski's</strong> dynamic survey published in the <a href="https://www.combinatorics.org" target="_blank" style="color: var(--accent-blue);">Electronic Journal of Combinatorics</a>.</p>
             `,
@@ -1788,7 +1788,7 @@
                 <p>找到所有这样的图，甚至确定它们存在的最大 n，都是组合数学中的著名难题。大多数拉姆齐数仍然未知——我们只知道它们的上界和下界。</p>
                 <div class="challenge">
                     <strong>${trophyIcon}开放挑战：</strong>找到一个 <span class="highlight">43 顶点的 Ramsey(5,5) 图</span>！<br><br>
-                    目前所有 42 顶点的 Ramsey(5,5) 图都已被找到，但不确定是否存在 43 顶点的图。R(5,5) 的下界自 <strong>1989 年</strong>以来就没有被改进过。只要找到一个这样的图，就是这个领域 35 年来的重大突破！
+                    目前所有 42 顶点的 Ramsey(5,5) 图都已被找到，但不确定是否存在 43 顶点的图。R(5,5) 的下界自 <strong>1989 年</strong>以来就没有被改进过。只要找到一个这样的图，就是这个领域 ${new Date().getFullYear() - 1989} 年来的重大突破！
                 </div>
                 <p>有关 Ramsey 图的最新研究，请参见 <strong>Radziszowski</strong> 的动态综述，持续更新刊登于<a href="https://www.combinatorics.org" target="_blank" style="color: var(--accent-blue);">电子组合学期刊</a>。</p>
             `