<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Brown 😎 on Medium]]></title>
        <description><![CDATA[Stories by Brown 😎 on Medium]]></description>
        <link>https://medium.com/@danLeBrown?source=rss-f5610999cb76------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*IqHTIw1HhlT3t12Z0eLQ7w.jpeg</url>
            <title>Stories by Brown 😎 on Medium</title>
            <link>https://medium.com/@danLeBrown?source=rss-f5610999cb76------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Thu, 19 Nov 2026 15:13:10 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@danLeBrown/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[My thoughts on the Maths Genius whom everyone misunderstood]]></title>
            <link>https://medium.com/@danLeBrown/my-thoughts-on-the-maths-genius-whom-everyone-misunderstood-c6e9c8eaf2dc?source=rss-f5610999cb76------2</link>
            <guid isPermaLink="false">https://medium.com/p/c6e9c8eaf2dc</guid>
            <category><![CDATA[history]]></category>
            <category><![CDATA[mathematics]]></category>
            <category><![CDATA[hobby]]></category>
            <category><![CDATA[writing]]></category>
            <dc:creator><![CDATA[Brown ]]></dc:creator>
            <pubDate>Tue, 30 Dec 2025 13:22:30 GMT</pubDate>
            <atom:updated>2025-12-30T13:22:30.821Z</atom:updated>
            <content:encoded><![CDATA[<p>Recently, I’ve been enamoured with the life of Srinivasa Ramanujan, also known as the “Man Who Knew Infinity” — albeit a tragic one. He died at 32 due to an inexplicable illness and had attempted suicide at the height of his depression in London.</p><p>You’re probably not new to this kind of sudden overwhelming feeling — the type that keeps you up past midnight, going down various rabbit holes, hoping to find enlightenment at the end. So far, I’ve seen the movie where he’s played by Dev Patel, as well as watched a couple of videos made by Veritasium (my favourite YouTube channel) and Fern. You could say I’ve been through everything, but his actual papers, his actual work 💀. Lol.</p><p>I also chuckle each time I come across comments on YouTube like, “At this rate, I’m going to watch the entire movie through these shorts,” or, “I’m 5 shorts away from finishing this movie.” I find these comments very amusing because the entire movie is right there on YouTube for anyone who wants to watch.</p><p>You see, the thing about Ramanujan, the misunderstood maths genius, is that math was akin to intuition for him — y’know, the type of intuition you get when you’re intimately familiar with a subject, skill, or craft. If you recall <em>Atomic Habits</em>, you might remember the story of the nurse who diagnosed her father-in-law with a stroke just before it could happen. She looked at him, felt that something inexplicable was wrong, and immediately said, “I don’t like the way you look. You should get yourself checked.” She saved his life.</p><p>Sir Ramanujan, however, is not the reason I’m writing this. <em>“A head fake? What!!”</em> Sorry.</p><p>I’m writing this because of two other characters in his story: G.H. Hardy and John Edensor Littlewood. These two characters play supporting roles in the movie, but in real life, they were also great mathematicians in their own right. During one of my “research” sessions (if I can call it that), I came across a very popular “unsolvable” maths problem known as Goldbach’s Conjecture [<em>check footnotes</em>]. As the story goes, Goldbach postulated that “every integer greater than 2 can be written as the sum of 3 prime numbers.” But his good friend, Euler (also regarded as a GOAT in mathematics, as I later found out), took things further and separated this conjecture into the now-famous problem sets:</p><ol><li><strong>Weak Goldbach Conjecture:</strong> Every odd number greater than 5 can be written as the sum of three primes; i.e., N(odd) = p1 + p2 + p3.</li><li><strong>Strong Goldbach Conjecture:</strong> Every even number greater than 2 can be written as the sum of two primes; i.e., N(even) = p1 + p2</li></ol><p>To see both conjectures in action, let’s take them one by one:</p><p><strong>Weak Goldbach Conjecture:</strong> Starting from 7, we see that:</p><ul><li>7 = 2 + 2 + 3</li><li>9 = 3 + 3 + 3</li><li>11 = 5 + 3 + 3</li><li>13 = 5 + 5 + 3</li><li>15 = 5 + 7 + 3</li></ul><p>Did you notice any repeating pattern? Did you notice that every odd number includes the addition of 3? If you did, good eye! Hmm… maybe you’re something of a mathematician yourself.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/1*lNrwmXKndGg2uc48FjiWkA.jpeg" /><figcaption>I bet you are looking like this right now</figcaption></figure><p>Well, you’re not the first to notice, because Euler apparently figured this out — and so, Goldbach’s strong conjecture was born.</p><p><strong>Strong Goldbach Conjecture:</strong> Starting from 4, we see that:</p><ul><li>4 = 2 + 2</li><li>6 = 3 + 3</li><li>8 = 5 + 3</li><li>10 = 5 + 5</li><li>12 = 5 + 7</li></ul><p>Did you notice anything else? If you didn’t, that’s okay; it’s the kind of intuition I also lack.</p><p>You see, Euler figured out that to prove the Weak Goldbach Conjecture, we only need to prove the Strong Goldbach Conjecture and just add 3 to its proofs to derive the “weak.”</p><blockquote><em>I regard this as a completely certain theorem, although I cannot prove it.</em></blockquote><p>~ Leonhard Euler</p><p>To see this in action, let’s take all of our examples of the “Strong” and add 3 to them:</p><ul><li>2 + 2 + 3 = 7</li><li>3 + 3 + 3 = 9</li><li>5 + 3 + 3 = 11</li><li>5 + 5 + 3 = 13</li><li>5 + 7 + 3 = 15</li></ul><p>And just like that, you can see that all even numbers are combinations of prime numbers, and all odd numbers are combinations of those prime numbers plus 3.</p><p>You can find more about this interesting math problem here:</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2Fx32Zq-XvID4%3Ffeature%3Doembed&amp;display_name=YouTube&amp;url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3Dx32Zq-XvID4&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2Fx32Zq-XvID4%2Fhqdefault.jpg&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/facb910c6f45eb4c183b20cdadf3a35f/href">https://medium.com/media/facb910c6f45eb4c183b20cdadf3a35f/href</a></iframe><p>So, why am I writing all of this? What’s the deal with the conjecture? And why am I suddenly a fanboy? Chill… I’ll answer all of your hasty questions shortly.</p><p>Remember those two mathematicians, G.H. Hardy and John Edensor Littlewood? You see, they too tried to prove Goldbach’s conjecture, as did many others, like the Chinese mathematician Chen Jingrun (I believe he also deserves an honourable mention). But their approach — or at least, the way they went about it as explained in the video — is what caught my attention.</p><p>G.H. Hardy and John Edensor Littlewood imagined a counting machine. “As input, it would take all possible combinations of 3 prime numbers smaller than N. For each combination, it would add them up and check if that sum equals N, and if it does, the machine increments the counter by 1. If not, the machine does nothing; it moves on to the next combination.”</p><p>I know what you’re thinking… “these scientists and their thought experiments!!”</p><p>But let’s see quickly how this machine would work — i.e., loop through prime number combinations — using 15 as an example. Here, each item in the ordered list is the result of each iteration:</p><ol><li>2 + 2 + 2 = 6 ≠ 15</li><li>2 + 2 + 3 = 7 ≠ 15</li><li>2 + 2 + 5 = 9 ≠ 15</li><li>2 + 2 + 7 = 11 ≠ 15</li><li>…</li></ol><p>Okay, writing all of the possible combinations is going to take too long, so let’s employ some “intuition,” shall we 😉?</p><p>First, let’s list out all the prime numbers less than 15: [2, 3, 5, 7, 11, 13]</p><p>If we continue at this rate, what’s the largest prime number we’re going to reach before 15? 13!</p><ul><li>So, we know that 2 + 2 + 13 = 17 ≠ 15.</li></ul><p>Next, let’s step down to 11, and suddenly, 2 + 2 + 11 = 15! Intuition!!</p><p>This is where the machine increments the counter by 1, before looping to find another combination.</p><p>You might immediately realize that, since we’re talking about combinations of prime numbers, another combination could be 2 + 11 + 2 or 11 + 2 + 2. These are known as duplicates. Now, I don’t remember whether we’re also interested in the permutations of these duplicates — i.e., whether all three arrangements of 2, 2, 11 are needed or just one is enough. Thankfully, it doesn’t matter to the point I’m trying to make. So, using “intuition” and skipping right ahead, we can be certain of a few more combinations:</p><ul><li>2 + 3 + 3 = 8 ≠ 15</li><li>2 + 3 + 5 = 10 ≠ 15</li><li>2 + 3 + 7 = 12 ≠ 15</li><li>…going to skip a few, can you figure out why? [<em>check footnotes</em>]</li><li>2 + 5 + 7 = 14 ≠ 15</li><li>2 + 7 + 7 = 16 ≠ 15</li><li>3 + 5 + 7 = 15. This is where the machine increments the counter by 1 again, before looping to find other combinations.</li></ul><p>Well, at the end, we’re only going to have two combinations: {2, 2, 11} and {3, 5, 7}.</p><p>Now, G.H. Hardy and John Edensor Littlewood imagined this counting machine and started working on a mathematical formula that simulated it. This ability to use mathematical formulas to simulate things is what marvels me the most. Like, how?? How do you even come up with that? But they did it! They did so by building on earlier work done by Ramanujan and Hardy himself — Circle Theory. It entails a lot of equations that go over my head today, but I find it intriguing nonetheless.</p><p>As a software engineer (shameless plug), I can write functions and loops that simulate this on a small scale, but how do you do such a thing with mathematics? This is the kind of intuition mathematicians have — and the audacity to even dream that it’s possible!</p><p>As this stranger on the internet, BingusDingus, put it:</p><blockquote><em>Most great mathematicians couldn’t even do calculations like that in their head so fast. Being good at math isn’t measured by your ability to be a human calculator, it’s about knowing the fundamentals of mathematics and being able to use them to create solutions. It’s about thinking in ways the human brain was never made to.</em></blockquote><p>That last sentence is the entire reason I was inspired to write this article. <em>“Another head fake? What!!”</em> Sorry… again.</p><p>In the movie, Hardy says something about Ramanujan’s equations that encapsulates this sentiment as well. In the scene, Littlewood is saying to Hardy, “If this chap [Ramanujan] turns out to be genuine, you might have to reconsider.” To which Hardy replies, “He [Ramanujan] must be genuine. Who would have the imagination to invent all that?”</p><p>Ramanujan understood maths on such a level that I would say he had a strong spiritual connection with the subject. He’s also responsible for many now-famous quotes, but as I come to the end, I’ll leave you with the most famous of all:</p><blockquote><em>An equation means nothing to me unless it expresses a thought of God.</em></blockquote><p>What a badass!</p><h3>Footnotes</h3><ol><li>My best guess as to why Goldbach postulated his original conjecture that way is that, at the time, 1 was also regarded as a prime number, so 3, for instance, was a combination of {1, 1, 1}. But when Euler revised this, he had to bump up the starting numbers for each problem set. I have not confirmed this.</li><li>I skipped 2 + 3 + 11 because I could intuitively tell that it would be larger than 15 (our desired result). Next, I skipped 2 + 5 + 3 because a combination of those prime numbers already existed in an earlier iteration.</li></ol><p>Here are some more recommended videos to watch if you’re interested:</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2FfHRS_NOs24w%3Ffeature%3Doembed&amp;display_name=YouTube&amp;url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DfHRS_NOs24w&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2FfHRS_NOs24w%2Fhqdefault.jpg&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/0b2e9e468856d164a3a82296801ec1db/href">https://medium.com/media/0b2e9e468856d164a3a82296801ec1db/href</a></iframe><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2FcZSDSKC9z54%3Ffeature%3Doembed&amp;display_name=YouTube&amp;url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DcZSDSKC9z54&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2FcZSDSKC9z54%2Fhqdefault.jpg&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/a057a14d9ee5982c706f69d1828fb5b8/href">https://medium.com/media/a057a14d9ee5982c706f69d1828fb5b8/href</a></iframe><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c6e9c8eaf2dc" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[How Unit Tests Saved My Sanity]]></title>
            <link>https://medium.com/@danLeBrown/how-unit-tests-saved-my-sanity-71c6a577e563?source=rss-f5610999cb76------2</link>
            <guid isPermaLink="false">https://medium.com/p/71c6a577e563</guid>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[unit-testing]]></category>
            <category><![CDATA[nestjs]]></category>
            <dc:creator><![CDATA[Brown ]]></dc:creator>
            <pubDate>Fri, 16 May 2025 14:21:50 GMT</pubDate>
            <atom:updated>2025-05-16T14:21:50.289Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*TmMdZpAxMTcc3BgW" /><figcaption>The <em>This Is Fine</em> dog (meme) sitting at a desk.</figcaption></figure><p>I’ve been working on a project for some time. My client wanted a dashboard that would allow him to manage proposal drafting and reduce the back-and-forth involved in ensuring he and his prospective clients were on the same page regarding costs, features, timelines, deliverables, etc.</p><p>His current workflow uses Excel for everything; a workflow which has taken him at least a year to perfect. So, we were to build a dashboard to replicate and manage all of that — with some additional functionalities, of course!</p><p>At first, it seemed fairly straightforward and soon, I was done setting up the project structure, testing, api documentation, and other basics.</p><p>I used Nest JS because I enjoy TS. Static typing is now a requirement for everything I build. I set up the tests to run against test containers. Test containers ensured my tests mirror real-world conditions; no more swapping out Postgresql for SQLite and dealing with some quirky constraints.</p><p>Before I knew it, it was time to get to the meat of the matter: tracing cells across various sheets and building functions out of them. Thankfully, all the calculations were confined to one spreadsheet!</p><p>I’d written the e2e tests for CSRF tokens, authentication, permissions, API endpoints — all the good stuff! But testing the core requirement, proposal generation, wasn’t as clear-cut. Replicating his complex Excel logic in code proved trickier than expected, and after some tinkering, it hit me; I’d found <strong>a case for unit tests!</strong></p><p>Until now, I’d mostly shied away from writing unit tests. <em>“They’re useful for mocking, but I’m not mocking anything here,”</em> I’d thought to myself several times. Now, they could solve a problem that would be too tedious to solve with e2e tests, especially with all the various conditions involved in drafting a proposal. I also had a personal requirement for posterity’s sake: how can I preemptively reduce debug hours if something went wrong?</p><p>So, the first thing I did was to go through the entire Excel spreadsheet for the umpteenth time! Until now, whenever something (the output of a cell and the results of the code) didn’t tally, I’d trace the code and the spreadsheet to find discrepancies. But repeating this process over and over again wasted too much time.</p><p>I knew enough about the spreadsheet, but apparently, not enough to avoid <em>cooking beans</em>. So, out of frustration, I wrote a document on the spreadsheet titled, <strong>“I am tired of trying to understand this thing from top-to-bottom each time,” </strong>where I broke down each cell into mathematical functions that were further explained by their respective paragraphs. Eventually, the document would become a tree of dropdowns, acting as a guide.</p><p>With the spreadsheet finally documented, the next challenge was clear: translate those dropdowns and paragraphs into testable functions. But even this came with a caveat — after all, the goal was to write tests for all my helper functions. So, to make unit testing effective and also make future debugging easier, I had to make everything a function — and I mean everything! No function would handle some obscure logic directly; instead, it’d delegate to smaller, independently testable functions. I would do this recursively until every function carried out only basic arithmetic operations: addition, logarithms, percentages, rounding up/down, etc.</p><p>The final step, the cherry on top, was to have a snapshot (a JSON object) that broke down the output of the code. In this snapshot, each cost, from the total to the unit cost, was repeatedly broken down in a way that mimicked the flow of calculations in the spreadsheet!</p><p>This approach worked — stupendously well, I must say! Functions called functions, and each was independently tested. At the end, I just had to write extra e2e tests that simulated the entire sequence of calls the FE would make from the admin’s POV and the prospective client’s.</p><p>Now, with passing unit and e2e tests, I can trust the system — and maybe, just maybe, preserve my sanity until the next discrepancy shows up. 💀</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=71c6a577e563" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Permission denied (publickey) error when using Git?]]></title>
            <link>https://medium.com/@danLeBrown/permission-denied-publickey-error-when-using-git-cf5828832e9d?source=rss-f5610999cb76------2</link>
            <guid isPermaLink="false">https://medium.com/p/cf5828832e9d</guid>
            <category><![CDATA[authentication]]></category>
            <category><![CDATA[git]]></category>
            <category><![CDATA[ci-cd-pipeline]]></category>
            <category><![CDATA[ssh-keys]]></category>
            <category><![CDATA[github]]></category>
            <dc:creator><![CDATA[Brown ]]></dc:creator>
            <pubDate>Thu, 26 Jan 2023 23:20:22 GMT</pubDate>
            <atom:updated>2023-01-27T08:22:17.355Z</atom:updated>
            <content:encoded><![CDATA[<p>Are you trying to run a GitHub action/ workflow? Or are you simply trying to pull some changes on a remote server or your local machine? Do not fret! Here are two simple ways to fix this issue.</p><p>Assuming you’ve crossed off all the requirements–generating an SSH key and adding this SSH key to your GitHub account, run <a href="https://stackoverflow.com/a/59145088/11465245">this command </a>on your remote/local machine</p><pre>sudo cp ~/.ssh/* /root/.ssh/</pre><p>This command gives your root user (on your remote/local machine) access to your previously generated SSH keys.</p><p>Next, re-run your failed workflows, actions or `git clone …` operation.</p><h4>Did you come back again?</h4><p>If you’re back here, that would mean that the above hotfix 🔥 didn’t work.</p><p>I must admit, “this is very odd”; however, do not worry, as I still have a few more tricks up my sleeves.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/400/0*EiNw5y7PnJyS3fJu.gif" /><figcaption>Let’s get down to business!</figcaption></figure><p>To understand why this <strong>“Permission error”</strong> is happening, you need to realize that you set yourself up for this when you cloned that repo through its SSH link variant. This SSH link looks something like this:</p><pre>git@github.com:Ayomide-Daniel/Ayomide-Daniel.git</pre><p>Now, there are two ways to solve this issue. There’s the lazy way (which I recommend), and then there’s the hard way🙄. And like Bill said:</p><blockquote>“I choose a lazy person to do a hard job. Because a lazy person will find an easy way to do it.”</blockquote><h3>The Lazy Way</h3><p>First, get rid of your remote link by running:</p><pre>git remote remove origin</pre><p>Next, copy the HTTPS variant of the repo link and add it as your remote origin.</p><pre>git remote add origin https://github.com/Ayomide-Daniel/Ayomide-Daniel.git</pre><p>I know you’re getting excited; you can feel the solution coming.</p><p>Chill bruh! Chill! 😏</p><p>Let’s address a digression that will soon become handy.</p><p>Go to your GitHub Profile at <a href="https://github.com/settings/tokens">https://github.com/settings/tokens</a> and generate a classic token for your GitHub account.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Cku0Q4MwkjvfkpYBGl2B5A.png" /><figcaption>Generate an auth token for your GitHub account since auth via passwords has been deprecated.</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Epo-iGkUZiPj9Ba9DZfs9A.png" /><figcaption>Complete your GitHub access token creation.</figcaption></figure><p><strong><em>NB: Please remember to copy your token somewhere.</em></strong></p><p>So, why did we digress? Well…</p><p>Git password authentication (on the CLI) has been deprecated for a while; users are advised to <a href="https://github.blog/changelog/2021-08-12-git-password-authentication-is-shutting-down/">authenticate themselves via access tokens.</a> However, authenticating with these tokens over and over can quickly become annoying. To prevent this from happening, run this command on your remote/local machine before resuming your cloning operation.</p><p><strong><em>NB: Use the token you copied as your password</em></strong></p><pre>git config credential.helper store<br>git pull origin {BRANCH_NAME}</pre><h4>The promised land</h4><p>Upon reaching here, go back, and re-run all your failed GitHub workflows, actions, `git clone …`, and sundry.</p><p>Thou hast earned thy victory!</p><h3>The hard way</h3><p>Bruh! What do you want from me😭??</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/800/0*b6eTHAbDq-nxulwQ.png" /></figure><p>Just kidding! If I get more requests to add this, I will. However, this should do for now.</p><p>Happy coding!</p><p>Brown 😎</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=cf5828832e9d" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Perhaps death is peace.]]></title>
            <link>https://medium.com/@danLeBrown/perhaps-death-is-peace-4e72cce46afb?source=rss-f5610999cb76------2</link>
            <guid isPermaLink="false">https://medium.com/p/4e72cce46afb</guid>
            <category><![CDATA[thoughts]]></category>
            <category><![CDATA[inspiration]]></category>
            <dc:creator><![CDATA[Brown ]]></dc:creator>
            <pubDate>Mon, 02 Aug 2021 02:16:56 GMT</pubDate>
            <atom:updated>2021-08-02T20:47:16.898Z</atom:updated>
            <content:encoded><![CDATA[<p>Think about life after death for a minute, but during this process, remember to be open-minded and be careful that for every good thing you think that happens on the other side, the exact polar opposite could be what happens. After all, “only God knows what happens after death.”</p><p>Perhaps death is peace with no struggles, no goals, no aspirations, no endless cycle of life getting you down and you striving to bounce back up. Just eternal quietness.</p><p>Some might say this is a little selfish, a quick way out. And to be honest, there’s some truth in that because death brings pain for those you leave behind. If I’m even half as missed (in death) as my grandma and grandpa were after their deaths (God bless their souls), people will cry and wail and maybe for a long time will wonder what happens next in their lives. But over time, they’ll heal, and life continues. I have seen this happen a few times to know that it’s &quot;a truth.&quot; Yes, I’ll be remembered, but I’ll still be gone.</p><h3>Religion is a bit harsh</h3><p>But thanks to religion, what will be peace on the other side seems to come at a cost. There are things I must do and avoid to attain this eternal peace. A misstep, misdeed, omission, sin, and I will be served the exact opposite of this peace. Hell, eternal torments, fire, and brimstone, everything but that peace I hoped to find. I state this according to religion. Perhaps, I’m wrong about this, and there’s more to it. Just assume I’m paraphrasing. Hopefully, you get the idea.</p><p>For me, I’ve found peace in religion and believe that she brings hope, joy, love, and all the happy feelings. I’ve been down enough times to realize the difference after opening myself up and being in the presence of the Lord. So yes, I believe in God and Jesus Christ as my personal Lord and Saviour. Religion just seems a bit harsh. I read something on Twitter sometimes back, and I feel it explains my situation correctly.</p><blockquote>&quot;If you are a young and dependent person in Nigeria, you may be right not to believe in God or any supernatural force. But to be an independent adult in Nigeria, if you don&#39;t believe in God and miracles, well, you must have a strong heart.&quot;</blockquote><h3>School na scam?</h3><p>Concerning school and education, I think about it sometimes. True story, one time, I was on the toilet and thinking about how consequential or inconsequential school is in the grand scheme of things. Say I leave primary school by 10. If things go right, I’ll spend 6 years in Senior secondary school and graduate by 16, enter the university and let’s say I spend 5 years in the university, I’ll graduate by 21, and blah blah blah. One thing is clear. Learning is important. It gives me knowledge, power, allows me to make smarter decisions, and because of these, I will have access to opportunities and the good things in life I’d otherwise not get if I was uneducated. To me, that’s all I’ve found to it. I agree that it’s a little naive, so be sure to enlighten me more on this matter if I’ve missed an important point.</p><p>As for me, we are sent to school and do not use an informal educational style as the norm because we have a social construct to follow, and it helps us prove to others that we’re up to their standards and deserve the good things of life. So, guys, school is not entirely a scam.</p><h3>Does money buy happiness?</h3><p>Concerning money, jeez, I still have a lot to learn. It’s a well-known fact that I’m not the richest in the world. Thus, I’m not in the best position to tell you if money can buy happiness or not. All I know is it feels good to reach my financial goals, and when I hit them, I can only help but wonder what the next one will be. It’s a never-ending cycle. In addition, I’ve realized that money can buy the things that make me happy, but there’s a catch. I’ve got to wait. Say I feel a PS4 would make me happy, and I place an order, there’s still a waiting period. It doesn’t arrive at that moment. If I’m lucky and the store is just next door, well, I’ll still have to walk there, drive or do something. The point is there’s a gap between me now and that time in the future when I’m happy. What do I do then?</p><p>Thus, I’ve found that it’s important to always live in the present and try to enjoy the moment. I’ll end this by saying, happiness is a journey, not a destination. Make do of this as you see fit.</p><h3>A new beginning or a perfect ending?</h3><p>I don’t know what you’ll make of these words, sentences, write-up, whatever you may call it, and I doubt I know what your reaction will be. These have been my thoughts for the past months, and I got the idea to pen them down while washing plates tonight. One might call it diffused thinking. Perhaps, I should start a blog or a podcast where people can creatively write and express their thoughts like these and share them with the world. I’d only love to know that it ends up leaving the world a better place than I found it, prevent suicides (I tried to edit this away, but it kept coming up in my mind. Perhaps, due to the title), and also help inspire others. Kindly let me know what you think and if you’ll be happy to use such a platform.</p><h3>Thank you for reading.</h3><p>If you’ve come this far, I cannot say thank you enough for taking your time to read. I appreciate you, and I assure you that I’m well in good health, and sound mind. <br>Lastly, if you’re about to scream, shout at me in my DM or on a call, please, go easy on me. After all, since we’re both alive, we’re still figuring things out.</p><p>Thank you once again for reading.</p><p>Brown 😎.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=4e72cce46afb" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>