From adf2698fe3cbf09280815df3c34031d88860a38b Mon Sep 17 00:00:00 2001 From: wwc <78423238+de-soot@users.noreply.github.com> Date: Thu, 11 Dec 2025 18:43:12 +0800 Subject: [PATCH] edited 2nd diff post --- _posts/2025-12-10-2nd-diff.md | 4 +- _site/404.html | 8 +- _site/about.html | 12 +- _site/dark-mode.html | 32 ++-- _site/feed.xml | 326 ++++++++++++++++++++++++++++------ _site/giscus-comments.html | 22 +-- _site/index.html | 17 +- _site/justify-text.html | 30 ++-- _site/robots.txt | 2 +- _site/sitemap.xml | 18 +- about.md | 4 +- 11 files changed, 351 insertions(+), 124 deletions(-) diff --git a/_posts/2025-12-10-2nd-diff.md b/_posts/2025-12-10-2nd-diff.md index e69426d..23ac34e 100644 --- a/_posts/2025-12-10-2nd-diff.md +++ b/_posts/2025-12-10-2nd-diff.md @@ -110,13 +110,13 @@ Again, because it goes from (d1)1 to (d1)n Tn = a1 + (n - 1)a2 + ((1 + 2 + 3 + ... + (n - 3) + (n - 2) + (n - 1)) + (n - 1)(-1))d2. -Now the pattern is easier to see. It is the sum of integers to (n - 1): +Now the pattern is easier to see. It is the sum of integers from 1 to (n - 1): Tn = a1 + (n - 1)a2 + (Sn-1 + (n - 1)(-1))d2 = a1 + (n - 1)a2 + (Sn-1 - (n - 1))d2. -Luckily for us, the great mathematician Gauss found a closed-form solution for finding the sum of integers to n when he was apparently 9 years-old or something (dubious): +Luckily for us, the great mathematician Gauss had already found a closed-form solution for finding the sum of integers from 1 to n when he was apparently 9 years-old or something (dubious): Tn = a1 + (n - 1)a2 + (1/2(n - 1)((n - 1) + 1) - (n - 1))d2 diff --git a/_site/404.html b/_site/404.html index 08f89c2..e7c6c86 100644 --- a/_site/404.html +++ b/_site/404.html @@ -9,16 +9,16 @@ - - + + +{"@context":"https://schema.org","@type":"WebPage","description":"Technical blog","headline":"de_soot","url":"https://de-soot.github.io/404.html"} - +