<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.9.5">Jekyll</generator><link href="https://captmd-11.github.io/blog/feed.xml" rel="self" type="application/atom+xml" /><link href="https://captmd-11.github.io/blog/" rel="alternate" type="text/html" /><updated>2024-05-14T02:05:46+00:00</updated><id>https://captmd-11.github.io/blog/feed.xml</id><title type="html">CaptMD-11</title><subtitle>Math Student | Carnatic Musician | AvGeek</subtitle><entry><title type="html">Math Docs Section</title><link href="https://captmd-11.github.io/blog/math_docs_section_intro" rel="alternate" type="text/html" title="Math Docs Section" /><published>2023-09-12T10:18:00+00:00</published><updated>2023-09-12T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/math_docs_section_intro</id><content type="html" xml:base="https://captmd-11.github.io/blog/math_docs_section_intro"><![CDATA[<p>A fun project.</p>

<p>Recently, I’ve been learning how to write $\rm\LaTeX$ documents. I write these documents mostly to analyze interesting math problems I see. I created a new section on the blog, titled “Math Docs,” where I share my solutions to some of these problems.</p>

<p>Currently, I have posted some solutions to integrals. Later, I plan to tackle math tournament problems. Feel free to check it out in case you’re interested.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[A fun project.]]></summary></entry><entry><title type="html">Taylor Series Approximation for the Normal Distribution</title><link href="https://captmd-11.github.io/blog/taylorseriesnormaldistribution" rel="alternate" type="text/html" title="Taylor Series Approximation for the Normal Distribution" /><published>2023-05-16T10:18:00+00:00</published><updated>2023-05-16T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/taylorseriesnormaldistribution</id><content type="html" xml:base="https://captmd-11.github.io/blog/taylorseriesnormaldistribution"><![CDATA[<p>An incredibly accurate and efficient method of approximating the integral of the standard normal distribution.</p>

<p>For a while now, I’ve been thinking about finding better ways of estimating the integral of the probability density function (for the standard normal distribution), as shown below.</p>

\[f(z) = \frac{1}{\sqrt{2\pi}} e^{-\frac{z^2}{2}}\]

<p>I started with analyzing different types of Riemann approximations, but soon realized that it could be quite inaccuate, since by using about a ten million subintervals, the approximate would only be accurate to around $6$-$7$ decimal places. In addition, it would also be resource-intensive for an ordinary computer to execute.</p>

<p>More recently, I thought about perhaps instead using a power series in order to approximate the integral. I realized that it would make sense to begin with using a Taylor series for $e^x$ centered about $0$, since the probability function is $e$-based and is symmetric about the $y$-axis. Then, I proceeded level by level in order to create a Taylor series for the probability function, as shown below.</p>

\[\begin{align}
&amp; e^z = 1 + z + \frac{z^2}{2!} + \frac{z^3}{3!} + \frac{z^4}{4!} + ... 

\\

&amp; e^{-\frac{z^2}{2}} = 1 + \left(-\frac{z^2}{2}\right) + \frac{\left(-\frac{z^2}{2}\right)^2}{2!} + \frac{\left(-\frac{z^2}{2}\right)^3}{3!} + \frac{\left(-\frac{z^2}{2}\right)^4}{4!} + ... 

\\

&amp; \frac{1}{\sqrt{2\pi}} e^{-\frac{z^2}{2}} = \frac{1}{\sqrt{2\pi}} \left( 1 + \left(-\frac{z^2}{2}\right) + \frac{\left(-\frac{z^2}{2}\right)^2}{2!} + \frac{\left(-\frac{z^2}{2}\right)^3}{3!} + \frac{\left(-\frac{z^2}{2}\right)^4}{4!} + ... \right)

\\

&amp; \hspace{2.7cm} = \frac{1}{\sqrt{2\pi}} \left(1 - \frac{z^2}{2 \cdot 1!} + \frac{z^4}{4 \cdot 2!} - \frac{z^6}{8 \cdot 3!} + \frac{z^8}{16 \cdot 4!} - ... \right)
\end{align}\]

<p>Now that we have the Taylor series for the probability function, we can now easily integrate this (what is essentially a) polynomial.</p>

\[\begin{align}
\int \frac{1}{\sqrt{2\pi}} e^{-\frac{z^2}{2}} dz &amp; = \frac{1}{\sqrt{2\pi}} \left(\frac{z}{1 \cdot 1 \cdot 0!} - \frac{z^3}{3 \cdot 2 \cdot 1!} + \frac{z^5}{5 \cdot 4 \cdot 2!} - \frac{z^7}{7 \cdot 8 \cdot 3!} + \frac{z^9}{9 \cdot 16 \cdot 4!} - ... \right)

\\

&amp; = \frac{1}{\sqrt{2\pi}} \sum_{n = 0}^{\infty} \frac{(-1)^n \cdot z^{2n+1}}{(2n+1) \cdot 2^n \cdot n!}
\end{align}\]

<p>Also, I found the interval of convergence for this infinite series in order to check that the approximation of the integral would apply for $z \in \mathbb{R}$, which is the domain of the probability function. The following limit confirmed this, since as $n \rightarrow \infty$, the limit goes to $0$, whose absolute value is always less than $1$. Therefore, this statement is always true, and thus the interval of convergence is $z \in (-\infty, \infty)$.</p>

\[\lim_{n \rightarrow \infty} \left| \frac{(-1)^{n+1} \cdot z^{2n+3}}{(2n+3) \cdot 2^{n+1} \cdot (n+1)!} \cdot \frac{(2n+1) \cdot 2^n \cdot n!}{(-1)^n \cdot z^{2n+1}} \right|\]

<p>Hypothetically, if we were to find an exact value for this integral (assuming we take a definite integral), then we would need to evaluate the infinite series. We could find the exact sum for an infinite series if it was geometric or telescoping, but it doesn’t appear to be the case. So, I thought of further decomposing the Taylor series for the integral of the probability function into roots by taking each term of the series and setting it equal to $\frac{\frac{d^n}{dz} \cdot z^n}{n!}$, where $n$ is the indexing value of the series. Obviously, the even values of $n$ would correspond to a $\frac{d^n}{dz}$ value of $0$, since that is the only possible numeric component of the term that could “vary.”</p>

<p>Next, I wanted to analyze the progression of the absolute value of $\frac{d^n}{dz}$, since I already knew that we were dealing with an alternating series. Here below is a table that displays the values of the absolute value of $\frac{d^n}{dz}$ for the first $6$ odd values of $n$.</p>

<table bgcolor="black">

    <tr>
        <th><center>$n$</center></th>
        <th><center>$1$</center></th>
        <th><center>$3$</center></th>
        <th><center>$5$</center></th>
        <th><center>$7$</center></th>
        <th><center>$9$</center></th>
        <th><center>$11$</center></th>
    </tr>

    <tr>
        <th><center>$\left|\frac{d^n}{dz}\right|\biggr\rvert_{z=0}$</center></th>
        <th><center>$1$</center></th>
        <th><center>$1$</center></th>
        <th><center>$3$</center></th>
        <th><center>$15$</center></th>
        <th><center>$105$</center></th>
        <th><center>$945$</center></th>
    </tr>

</table>

<p>Ignoring the first term, the absolute value of $\frac{d^n}{dz}$ seems to first be multiplied by $3$, then by $5$, then by $7$, and so on. I tried coming up with a sequence generator for the absolute value of $\frac{d^n}{dz}$, but it turned out to be quite challenging. After collaborating with a few students in my math class, we determined the sequence generator to be $\frac{(2n)!}{n! \cdot 2^n}$, assuming that $n$ starts at $1$.</p>

<p>After substituting this into the sigma notation for the Taylor series for the integral of the probability function, here is the result:</p>

\[\int \frac{1}{\sqrt{2\pi}} e^{-\frac{z^2}{2}} dz = \frac{1}{\sqrt{2\pi}} \left(z + \sum_{n=1}^{\infty} \frac{(-1)^n \cdot z^{2n+1}}{n! \cdot 2^n \cdot (2n+1)}\right)\]

<p>The best part about using this series is that when we set the upper bound of the sum to just $5$, we get $12$ decimal places of accuracy. This makes for a much more efficient computation for a computer to handle, instead of using a Riemann sum of ten million subintervals. My next step is to find a way to find the exact value of the infinite series - no approximations. I’ll save that for another post :)</p>]]></content><author><name></name></author><summary type="html"><![CDATA[An incredibly accurate and efficient method of approximating the integral of the standard normal distribution.]]></summary></entry><entry><title type="html">SIMA LA Tyagaraja Aradhana</title><link href="https://captmd-11.github.io/blog/simala_tyagaraja_day" rel="alternate" type="text/html" title="SIMA LA Tyagaraja Aradhana" /><published>2023-03-27T10:18:00+00:00</published><updated>2023-03-27T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/simala_tyagaraja_day</id><content type="html" xml:base="https://captmd-11.github.io/blog/simala_tyagaraja_day"><![CDATA[<p>Over the weekend in Anaheim, CA.</p>

<p>I wanted to share a recording of me and my friend, Srivatsan Srinivasan, presenting <i>Raksha Bettare</i>, a Bhairavi krithi, for South Indian Music Academy (SIMA) of Los Angeles as part of the Tyagaraja Aradhana.</p>

<iframe width="560" height="315" src="https://www.youtube.com/embed/QUFBJlJVIio" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" allowfullscreen=""></iframe>]]></content><author><name></name></author><summary type="html"><![CDATA[Over the weekend in Anaheim, CA.]]></summary></entry><entry><title type="html">TN Seshagopalan RTP</title><link href="https://captmd-11.github.io/blog/seshagopalanrtp" rel="alternate" type="text/html" title="TN Seshagopalan RTP" /><published>2023-03-12T10:18:00+00:00</published><updated>2023-03-12T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/seshagopalanrtp</id><content type="html" xml:base="https://captmd-11.github.io/blog/seshagopalanrtp"><![CDATA[<p>A brilliant Shanmukhapriya.</p>

<p>Recently, I have been listening a lot of concerts by the brilliant vocalist, Madurai TN Seshagopalan. I wanted to share a <i>Ragam-Thanam-Pallavi</i> in ragam <i>Shanmukhapriya</i> by him and his team (Nagai Sriram on violin, Guruvayur Dorai on mridangam, and S. Karthik on ghatam) that I was hearing.</p>

<p>Here are the links to Part $1$ and Part $2$ of the RTP.</p>

<iframe width="560" height="315" src="https://www.youtube.com/embed/cGPkrLzehJY" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" allowfullscreen=""></iframe>

<iframe width="560" height="315" src="https://www.youtube.com/embed/qeAcyPSupLE" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" allowfullscreen=""></iframe>]]></content><author><name></name></author><summary type="html"><![CDATA[A brilliant Shanmukhapriya.]]></summary></entry><entry><title type="html">Another Photography Session</title><link href="https://captmd-11.github.io/blog/photo_session2" rel="alternate" type="text/html" title="Another Photography Session" /><published>2023-02-05T10:18:00+00:00</published><updated>2023-02-05T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/photo_session2</id><content type="html" xml:base="https://captmd-11.github.io/blog/photo_session2"><![CDATA[<p>Capturing the scenes during a trip.</p>

<p>Yesterday, my friend Ayush and I went on a bike ride to take some more photos. We’re into nature photography, so we decided to bike along a scenic route and capture anything we thought was interesting. I’d like to share $2$ photos that I took during our trip:</p>

<p><img src="assets/images/powerline_and_grass.jpg" width="700" alt="graph" style="border-radius:3%" /></p>

<p>This story behind this next photo is pretty interesting. So we were at a pond and I thought of taking a reflection shot aiming at the water, with a tree as the subject. The tree would be in the frame, since the angle between the tree and the water was equal to the angle between me and water. When I tried to take the shot, the tree was upside down in the frame as expected. Ayush tried this as well, except he held the camera upside down and took the shot, thus making the tree in an “upright” position in the photo. I utilized his technique and took the picture below.</p>

<p><img src="assets/images/tree_water_reflection.jpg" width="700" alt="graph" style="border-radius:3%" /></p>

<p>At first glance, it doesn’t even seem like this is a reflection picture, but as you examine closely, there are faint water ripple marks that give away the technique!</p>]]></content><author><name></name></author><summary type="html"><![CDATA[Capturing the scenes during a trip.]]></summary></entry><entry><title type="html">VCSV Release!</title><link href="https://captmd-11.github.io/blog/vcsvrelease-copy" rel="alternate" type="text/html" title="VCSV Release!" /><published>2023-01-05T10:18:00+00:00</published><updated>2023-01-05T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/vcsvrelease%20copy</id><content type="html" xml:base="https://captmd-11.github.io/blog/vcsvrelease-copy"><![CDATA[<p>A complementary addition to VStats.</p>

<p>Several months ago, I wrote a post about VCSV, a program that would allow users to analyze data contained inside CSV files using VStats functions. The only issue was that a large portion of VStats functions require arrays as inputs. So, I wrote VCSV, a Java library that would help with parsing the raw data into an array format.</p>

<p>You can now download the VCSV library <a href="https://captmd-11.github.io/blog/vcsv/" target="_blank">here</a>!</p>

<p>Have fun with your statistical adventures!</p>]]></content><author><name></name></author><summary type="html"><![CDATA[A complementary addition to VStats.]]></summary></entry><entry><title type="html">Keesu Keesendru</title><link href="https://captmd-11.github.io/blog/keesu_keesendru" rel="alternate" type="text/html" title="Keesu Keesendru" /><published>2023-01-02T10:18:00+00:00</published><updated>2023-01-02T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/keesu_keesendru</id><content type="html" xml:base="https://captmd-11.github.io/blog/keesu_keesendru"><![CDATA[<p>By an amazing vocalist-mridangist combo.</p>

<p>Recently, I heard the Bhairavi Tiruppaavai (a composition of Andal) rendered by Sanjay Subrahmanyan (vocal), Nagai Sriram (violin), Palladam Ravi (mridangam), and KV Gopalakrishnan (khanjira).</p>

<p>Sanjay Subrahmanyan was brilliant, coming up with all sorts of captivating sangathis. Also, Palladam Ravi played really well. The way he made the shruti of the mridangam heard towards the beginning of the anupallavi was simply beautiful. I think the both of them make an excellent combo.</p>

<p>Here is the link to the recording:</p>

<iframe width="560" height="315" src="https://www.youtube.com/embed/4jJ9ycAPAdc" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture" allowfullscreen=""></iframe>]]></content><author><name></name></author><summary type="html"><![CDATA[By an amazing vocalist-mridangist combo.]]></summary></entry><entry><title type="html">NYTimesGames Release!</title><link href="https://captmd-11.github.io/blog/nytimesgamesrelease" rel="alternate" type="text/html" title="NYTimesGames Release!" /><published>2022-12-31T10:18:00+00:00</published><updated>2022-12-31T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/nytimesgamesrelease</id><content type="html" xml:base="https://captmd-11.github.io/blog/nytimesgamesrelease"><![CDATA[<p>A culmination of an exciting journey.</p>

<p>In my previous post, I introduced my latest project of attempting to write some programs that would help solve the Letter Boxed and Spelling Bee <a href="https://www.nytimes.com/crosswords" target="_blank">puzzles</a> on the NY Times Games website. Well, you can now download these programs (in the form of JAR libraries) <a href="https://captmd-11.github.io/blog/nytimesgames/" target="_blank">here</a>!</p>

<p>I would highly recommend checking out the  <a href="https://github.com/CaptMD-11/NYTimesGames#nytimesgames" target="_blank"><samp>README</samp></a> for more information.</p>

<p>Have fun using these libraries and I wish everyone a happy $2023$!</p>]]></content><author><name></name></author><summary type="html"><![CDATA[A culmination of an exciting journey.]]></summary></entry><entry><title type="html">Solving The NY Times Games</title><link href="https://captmd-11.github.io/blog/nytimes_games_code_intro_post" rel="alternate" type="text/html" title="Solving The NY Times Games" /><published>2022-11-15T10:18:00+00:00</published><updated>2022-11-15T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/nytimes_games_code_intro_post</id><content type="html" xml:base="https://captmd-11.github.io/blog/nytimes_games_code_intro_post"><![CDATA[<p>A “puzzling” project.</p>

<p>For around a year, I’ve been playing puzzles on The NY Times website. I highly recommend <a href="https://www.nytimes.com/crosswords" target="_blank">these</a> puzzles to anyone who’s looking for something to challenge their mind.</p>

<p>Around a week back, I began coding algorithms that could be used to solve the puzzles (particularly Letter Boxed and Spelling Bee). I’ve basically dedicated a class to each puzzle so that the member variables of the class stay organized (the class names are <code>LetterBoxed</code>, <code>SpellingBee</code>, etc.). Here’s the <a href="https://github.com/CaptMD-11/NYTimesGames" target="_blank">link</a> to the GitHub repository if you would like to check it out.</p>

<p>The objective of Letter Boxed is to make words with letters on the sides of a square, where consecutive letters cannot be from the same side. Additionally, the game gives you targets, like “try to solve in $5$ words” or “try to solve in $6$ words.” Although you can solve the puzzle in those many words, I aim to solve it in $1$ or maximum $2$ words.</p>

<p>However, the main challenge is to obtain a word list that contains words that match up closely with the word list that NY Times uses. For now, I’m using an Oxford English Dictionary containing $400000+$ words in a text file (<a href="https://github.com/dwyl/english-words/blob/master/words.txt" target="_blank">link</a>). If you find a better word list, please add it to the repository’s GitHub <a href="https://github.com/CaptMD-11/NYTimesGames/discussions/1" target="_blank">discussion</a>.</p>

<p>I’ll probably make the <code>LetterBoxed</code> class into a library available on the blog pretty soon.</p>

<p>The <code>SpellingBee</code> class is still in its early stages of development.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[A “puzzling” project.]]></summary></entry><entry><title type="html">My Venture into Photography</title><link href="https://captmd-11.github.io/blog/intro_to_photo" rel="alternate" type="text/html" title="My Venture into Photography" /><published>2022-09-28T10:18:00+00:00</published><updated>2022-09-28T10:18:00+00:00</updated><id>https://captmd-11.github.io/blog/intro_to_photo</id><content type="html" xml:base="https://captmd-11.github.io/blog/intro_to_photo"><![CDATA[<p>An exciting diversion.</p>

<p>A few weeks ago, my friend Ayush urged me to join him with his photography adventures. So, with my Nikon D$40$, I set out to take begin my nature photography excursions.</p>

<p>Just wanted to share some of the photos I took during our trips:</p>

<p><img src="assets/images/rocks_and_stream.png" width="700" alt="graph" style="border-radius:3%" />
<img src="assets/images/leaves.png" width="700" alt="graph" style="border-radius:3%" />
<img src="assets/images/rocks_and_still_water.png" width="700" alt="graph" style="border-radius:3%" />
<img src="assets/images/z2.png" width="700" alt="graph" style="border-radius:3%" />
<img src="assets/images/tree.png" width="700" alt="graph" style="border-radius:3%" />
<img src="assets/images/grass_plant_in_field.png" width="700" alt="graph" style="border-radius:3%" /></p>

<p>You can view all our photos <a href="https://photos.ayushnayak.me/" target="_blank">here<a></a>.</a></p>

<p>I hope to purchase some telephoto lens for aviation photography someday. Maybe that will open new doors :)</p>]]></content><author><name></name></author><summary type="html"><![CDATA[An exciting diversion.]]></summary></entry></feed>