<?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 Akshaj Narayan on Medium]]></title>
        <description><![CDATA[Stories by Akshaj Narayan on Medium]]></description>
        <link>https://medium.com/@akshajnarayanc?source=rss-12131c1d2564------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*OLATUoWAcdjX7M2r</url>
            <title>Stories by Akshaj Narayan on Medium</title>
            <link>https://medium.com/@akshajnarayanc?source=rss-12131c1d2564------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 20 Nov 2026 00:40:08 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@akshajnarayanc/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[The SAT Question that everyone got wrong]]></title>
            <link>https://medium.com/@akshajnarayanc/the-sat-question-that-everyone-got-wrong-ca0ebf38c493?source=rss-12131c1d2564------2</link>
            <guid isPermaLink="false">https://medium.com/p/ca0ebf38c493</guid>
            <dc:creator><![CDATA[Akshaj Narayan]]></dc:creator>
            <pubDate>Sun, 25 Oct 2026 00:35:59 GMT</pubDate>
            <atom:updated>2026-10-25T04:52:09.559Z</atom:updated>
            <content:encoded><![CDATA[<p>In 1982, there was one question that every single student got wrong. Here it is:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/538/1*Og1xdlp_DyoUnP-A056Pug.png" /></figure><p>I can tell you one thing, the answer 3 is wrong. But all of the other answers are wrong as well. The reason that the correct answer isn’t one of the options is that the testwriters themselves also thought that the answer was 3.</p><p>In that case, what is the correct answer?</p><p>To find the correct answer, I will show a visual representation of the circles moving, and their position after each revolution from a stagnant viewpoint or an outside frame of reference.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/959/0*WAYnE5koZ79joL0A" /></figure><p>The correct answer from a stagnant viewpoint is 4 because each time the small circle makes one full revolution around the big circle the arrow points down and in total, the arrow pointed down 4 times before the small circle returned to its starting point. Although the answer is 4 from the outside frame of reference, there is another perspective where the answer 3 isn’t entirely wrong.</p><p>This other perspective is when you look at the small circle moving when you are positioned at the center of the bigger circle and you are rotating in the same direction to keep track of the smaller circle’s movement. Below is another visual representation of what the circle looks like when we observe someone observing the smaller circle from an inside frame of reference.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/858/0*82dQ422AdItXU89t" /></figure><p>For someone obesrving the smaller circle from the center of the larger circle and rotating in the same direction following the smaller circle’s movement, one revolution would be when the arrow points towards the observer, or the center of the larger circle. With the concept of relative motion, if an observer outside a large circle observes a person at the center of the large circle who rotates once to keep track of a smaller circle, which rotates three times relative to that person, the outside observer sees the smaller circle rotating four times. This is because the smaller circle’s rotation consists of two components: the one rotation of the person relative to the outside observer and the three rotations of the smaller circle relative to the person. Since both rotations occur in the same direction, the outside observer sees the smaller circle rotate 1+3 = 4 times.</p><p>Another case for where the answer is three is when the we make the circemference of the large circle a line. This third visual representation shows the number of rotations that the small circle takes from the start of the line to reach the end of the line.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*a-X62hSxcl5k4toM" /></figure><p>The circular path forces the smaller coin to do an additional rotation. On a straight line, it rotates based on distance. But because a circle wraps around so the start and end points meet, the coin makes one extra full turn just to complete the loop.</p><p>Therefore, based on the frame of reference, there are actually two answers to the paradox, not just one.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=ca0ebf38c493" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[KINEMATICS OF MECANUM WHEELS]]></title>
            <link>https://medium.com/@akshajnarayanc/kinectics-of-mecanum-wheels-fdfbd88b4bb8?source=rss-12131c1d2564------2</link>
            <guid isPermaLink="false">https://medium.com/p/fdfbd88b4bb8</guid>
            <dc:creator><![CDATA[Akshaj Narayan]]></dc:creator>
            <pubDate>Sat, 26 Sep 2026 20:35:30 GMT</pubDate>
            <atom:updated>2026-09-27T05:29:38.168Z</atom:updated>
            <content:encoded><![CDATA[<p>Mecanum wheel makes an <em>X</em> formation — Refer to Pic 1</p><p>The L wheels are diagonal from each other and the same for the R wheels. Due to this, their placement forms an <em>X </em>shape.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/512/1*BBqczQpoir1XQ7yOp2WJUA.png" /></figure><p>Forward Movement — Refer to Pic 2:</p><p>All the wheels move forward. In this way what happens is that the front left and front right wheels cancel out the <em>x </em>direction, and the rear left and rear right wheels also cancel out the <em>x </em>direction. The only direction left is the positive <em>y </em>direction on all wheels and that moves the robot forward.</p><p>Backward Movement — Refer to Pic 3</p><p>All the wheels move backward. In this way what happens is that the front left and front right wheels cancel the <em>x </em>direction, and the rear left and rear right wheels also cancel out the <em>x </em>direction. The only direction left is the negative <em>y </em>direction on all wheels and that moves the robot backward.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/512/1*fBl1m3PYphQo3ZOgiB9L3g.png" /></figure><p>Clockwise Spinning — Refer to Pic 4</p><p>The front left and the front right wheels cancels the <em>y </em>direction and the front wheels move together in the positive <em>x </em>direction. At the same time, the rear left and rear right wheels cancel out the <em>y </em>direction and they move together in negative <em>x</em> direction. This causes the robot to spin clockwise on its center.</p><p>Counterclockwise Spinning — Refer to Pic 5</p><p>The front left and the front right wheels cancels the <em>y </em>direction and the front wheels move together in the negative <em>x </em>direction. At the same time, the rear left and rear right wheels cancel out the <em>y </em>direction and they move together in positive <em>x</em> direction. This causes the robot to spin counterclockwise on its center.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/512/1*utDgdkQh9mwn0b-DTHNAmg.png" /></figure><p>Right strafe — Refer to pic 6</p><p>The front left and the front right wheels cancels the <em>y </em>direction and the front wheels move together in the positive <em>x </em>direction. At the same time, the rear left and rear right wheels cancel out the <em>y </em>direction and they move together in positive <em>x</em> direction. This causes the robot to strafe right.</p><p>Left strafe — Refer to pic 7</p><p>The front left and the front right wheels cancels the <em>y </em>direction and the front wheels move together in the negative <em>x </em>direction. At the same time, the rear left and rear right wheels cancel out the <em>y </em>direction and they move together in negative <em>x</em> direction. This causes the robot to strafe left.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/512/1*0bju9xMvD_Q_1_3uz2etgw.png" /></figure><p>I hope you enjoyed my post! Let’s engage in a discussion in the comment section if you have any questions or suggestions.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=fdfbd88b4bb8" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Cryptography]]></title>
            <link>https://medium.com/@akshajnarayanc/cryptography-608b4c12d873?source=rss-12131c1d2564------2</link>
            <guid isPermaLink="false">https://medium.com/p/608b4c12d873</guid>
            <dc:creator><![CDATA[Akshaj Narayan]]></dc:creator>
            <pubDate>Fri, 21 Aug 2026 22:51:34 GMT</pubDate>
            <atom:updated>2026-08-21T22:51:34.518Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/512/1*kNwIEnVqnS9Th5JnkxCWQA.png" /></figure><p>Cryptography is a way of sending information between people so that unauthorized people, such as eavesdroppers, cannot access or understand it. There are 2 main kinds of cryptography: symmetric and a-symmetric cryptography. In symmetric cryptography, there is only one key that is responsible for both encryption (lock) and decryption (unlock). For example, Julius Caesar, a very important figure in world history used symmetric cryptography. What Caesar did was he sent an encrypted message encrypted by moving the alphabet three letters forward. Then he sent this encrypted message to another person. The other person then decrypted the encrypted message to finally figure the message out. The decryption method was already known by the receiver. This system lasted for a very long time as there were no computers around at that time period to break the encryption.</p><p>On the other hand, in asymmetric cryptography, there are 2 types of keys, a private and a public key. A private key is a key that is known by only the authorized person and should only be known by its owner. A public key on the other hand it a key known by multiple people and can be accessed by anyone. Although a private key can be used to mathematically derive a public key, a public key cannot practically be used to recover the private key. There is a system where:</p><p>Private key =&gt; Public key =&gt; Bitcoin Address</p><p>A Bitcoin address is like an email address because it is used to send Bitcoin to someone. The difference is that a Bitcoin address is used for Bitcoin transactions instead of email.</p><p>On the contrary, an address cannot be used to recover the public key, and a public key cannot be used to recover the private key either.</p><p>This is known as a <strong>one-way function</strong>, a function that is easy to perform a mathematical compution in one direction but the reverse direction, it would become extremely difficult to perform, alomst like being impossible. But in theory, there is still a ghost of a chance that the public key could turn into a private key.</p><p>To go deeper into real world cryptography, the identities of each key are needed to be understood. There is only one sole purpose of a public key which is to encrypt, and for a private key, there are two main purposes of it. The first for decryption and the other for identification. What identification means here is just like your ID. If someone is in a private key, then the world is assuming that you are the one online. Together these 2 keys make up asymmetric cryptography which is much more secure that symmetric cryptography.</p><p>An example of asymmetric cryptography that is used in the real world would be a question similiar to this:</p><p>“How can Alice and Bob transfer information between one another without, Eve who is intercepting their communication, being able to obtain it?</p><p>Assume Alice and Bob are super spies. Alice wants to send a message to Bob. If super spy Alice sends a direct message, an eavesdropper can steal that message and make a copy of it. If that happens the situation will get compromised. Instead, super spy Alice needs to encrypt the message using super spy Bob’s public key because when sending that encrypted message to super spy Bob, he is the only one that can decrypt it using his private key pair. Vice versa can happen as well.</p><p>Although this is a great way for secret communication between them, there is unadressed thought.</p><p>“If super spy Bob were to get the message, how does he know if the message is actually sent by super spy Alice?”</p><p>In these situations, this is where a ID comes in handy. To recap a private key is not only responsible for decrypting messages, but it holds your ID. Now instead of super spy Alice only encrypting the message using super spy Bob’s public key. Super spy Alice also creates a signature using her private key. Finally she encrypts the message along with her private key’s signature using super spy Bob’s public key. Then super spy Alice sends the message to super spy Bob. What super spy Bob does is he decrypts it using his private key and then he verifies the signature coming from super spy Alice. He verifies by extracing the signature and mathematically derives the public key out of that signature and sees whether or not the public key belongs to Alice.</p><p>MISSION ACCOMPLISHED! Both super spys were able to communicate between one another with trust, so that the eavesdropper wasn’t able to understand that message.</p><p>The key idea of cryptography is that two people can use mathematical operations to create shared or protected information while making it extremely difficult for an eavesdropper to reverse the process and discover the secret. Cryptographic systems use one-way functions, where calculating the result is easy but working backward to find the secret is computationally impractical.</p><p>Thanks for taking the time and reading through this post. More cryptography (RSA keys, and scalar elliptic curve) coming up in my next post…</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=608b4c12d873" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[CRYPTOGRAPHY MATH PROBLEM]]></title>
            <link>https://medium.com/@akshajnarayanc/cryptography-problem-52759b139d3a?source=rss-12131c1d2564------2</link>
            <guid isPermaLink="false">https://medium.com/p/52759b139d3a</guid>
            <category><![CDATA[cryptography]]></category>
            <category><![CDATA[probability]]></category>
            <category><![CDATA[mathematics]]></category>
            <category><![CDATA[quantum-computing]]></category>
            <dc:creator><![CDATA[Akshaj Narayan]]></dc:creator>
            <pubDate>Tue, 11 Aug 2026 18:09:40 GMT</pubDate>
            <atom:updated>2026-08-12T18:09:26.613Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*VdT6zEBZC2-dFLgkVdc10g.png" /></figure><p><strong>CRYPTOGRAPHY MATH PROBLEM</strong></p><p>When my dad was understanding the basics of cryptography, he came across an intriguing problem. Not only was the problem about cryptography but there was math required and my dad thought that this would be a great problem to discuss with me.</p><p>“There are 2 32-digit hexadecimal (base 16) numbers. What is the probability that the last 20 digits of both numbers collide (same) irrespective of whether the first 12 digits are the same or different.”</p><p>My dad had to do some explaining before the problem could make sense to me. But after all confusion was cleared, I thought that this would make a simple probability question.</p><p>In probability, the denominator represents the total number of possible outcomes, while the numerator represents the number of favorable outcomes. In this case, the total number of possible outcomes is</p><p>16³²*16³²</p><p>This is the total number of outcomes due to the fact that each 32-digit number has 16 cases for each digit because the number is in base 16 meaning that the first digit has outcomes</p><p>0, 1, 2, 3 ,4 ,5, 6 ,7, 8, 9, A, B, C, D, E, and F.</p><p>There are 16 cases for each favorable outcome for the first digit. Meaning there are 16² cases for the first 2 digits. This applies to the very last digit. Meaning that the total outcome would be 16³² for both numbers. Also for each 32-digit hexadecimal number, there are 16³² cases, thus proving that in total there are 16³²*16³² cases.</p><p>The denominator is found. All that is left is to find the numerator.</p><p>In order to find the numerator, the favorable cases have to be found. The problem asks us to find the probability that the last 20 digits of both numbers are the same. Now to find this, let’s say that we have our first number(16³² cases). In order to find the second number that fits the problem’s criteria we have to find the cases where the second number has exactly the same last 20 digits. The number of cases of that happening is:</p><p>16³²*16¹².</p><p>The 16³² is just the probability for the first number meaning that the favorable cases for the second number is 16¹².</p><p>Why?</p><p>The first 12 digits have 16 cases for the second number for each digit because they don’t have a given criteria that determines whether they have to be the same or different from the first number, meaning that they are free. But for the last 20 digits of the second number, they <strong>must</strong> be the same as the last 20 digits of the first number meaning that there is only one case for each of the last 20 digits of the second number. The computation would look like this:</p><p>16*16*16*16*16*16*16*16*16*16*16*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1*1=16¹²*1²⁰=16¹²</p><p>To finally recap, the denominator is 16³²*16³², and the numerator is 16³²*12¹².</p><p>The final probability is : (16³²*16¹²)/(16³²*16³²). Simplify and the answer comes down to 16¹²/16³²=1/16²⁰</p><p>Even though the mathematical answer to the question has been found, the title of this write-up is “Cryptography math problem”.</p><p>Where has any cryptography been involved in this question?</p><p>The problem given was:</p><p>“There are 2 32-digit hexadecimal (base 16) numbers. What is the probability that the last 20 digits of both numbers collide (same) irrespective of whether the first 12 digits are the same or different.”</p><p>This directly connects to cryptography because public-key cryptography uses a pair of keys: a public key and a private key. In Bitcoin, the private key is 32 bytes (256 bits, or 64 hexadecimal digits). The public key is derived from the private key using elliptic-curve mathematics.</p><p>The private key is kept secret, while the public key can be shared with others. The public key can be derived mathematically can be derived from the private key using a specific formula.</p><p><strong>Public Key=Private Key*G</strong></p><p>What the “G” stands for here is the generator (or base point) of the elliptic curve. It is a specific point on the curve that is fixed by the cryptographic system. In simple terms, “G” it is a known constant on the elliptic curve.</p><p>So you can think of it as:</p><p>Public key (Q) = Private key (d)*G</p><p>Here, dG means elliptic-curve scalar multiplication.</p><p>For example, if d=5, then conceptually:</p><p>5G=G+G+G+G+G</p><p>using the special addition rules for points on the elliptic curve.</p><p>So G is basically the fixed “starting point” that the private key operates on to produce the public key.</p><p><strong>On the other hand the public key cannot be derived into a private key. Private key to public key is a strict one-way mathematical formula.</strong></p><p>In real life, think of this as ice-cream. When ice-cream melts it turns into liquid. It cannot go back to its original form: the frozen ice-cream.</p><p>This is a great security system but there is one major problem to it: quantum computers. These computers have extremely fast computations far faster than a regular computer.</p><p>With more and more of these computers the cryptography system can eventually break. But still it will take millions of years because of the extraordinarily small chance it will take to find a private key.</p><p>In general, this simple probability question about matching hexadecimal digits into large numbers, can illustrate an important idea in cryptography: in theoretical terms there is a chance that the cryptographic security system fails, but in practical terms it is almost impossible for the system to break.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=52759b139d3a" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Bases]]></title>
            <link>https://medium.com/@akshajnarayanc/bases-f112223e4878?source=rss-12131c1d2564------2</link>
            <guid isPermaLink="false">https://medium.com/p/f112223e4878</guid>
            <category><![CDATA[mathematics]]></category>
            <category><![CDATA[base]]></category>
            <category><![CDATA[number-theory]]></category>
            <dc:creator><![CDATA[Akshaj Narayan]]></dc:creator>
            <pubDate>Tue, 11 Aug 2026 17:34:44 GMT</pubDate>
            <atom:updated>2026-08-11T18:15:10.432Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*A-cC0P7U95i5S2WXnfGuDA.png" /></figure><p>Bases</p><p>Intro: Bases, a branch of number theory, are simply the representation of the same number in different ways. The standardized base that Arabic numerals are written in is base 10.</p><p>Conversions:<br> If you were to convert a number in a certain base into that same number but in a different base you would have to make a few mathematical computations. For example when converting a number in base 10 lets take 100 into that same number just expressed in base 2, all that needs to be done is divide 100 repeatedly by 2 and continue the process and continuously track the remainder(s) until you arrive at a quotient that is smaller than 2. This would be:</p><p>100/2=50 r0</p><p>50/2=25 r0</p><p>25/2=12 r1</p><p>=&gt; 1100100</p><p>12/2=6 r0</p><p>6/2=3 r0</p><p>3/2=1 r1</p><p>When arriving at the smallest number in this case 1 that cannot be furthermore divided by 2. You take that number and put it at the final number of the remainders. The final number written in base 2 would be 1100100. Notice that the number written in base 2 are just the remainders of the repeated division being done except in reverse and the first 1 was just the quotient that couldn’t be furthermore divided by 2.</p><p>Now if you were to ask the question: “If base 10 could be converted into base 2, then couldn’t the reverse happen as well?”</p><p>The answer is <strong>yes</strong>. In this case we converted base 10 into base 2 but we can also convert base 2 into base 10. The way we do this though is different. Instead of dividing repeatedly by 10, you could do it in a much faster way which would be to just multiply the number by the powers of the number which base that number is in and all of the products up. To put it in simpler terms, if you were to convert a base 2 number into base 10, say 110101002 you would just have to do this:</p><p>1*2⁷+1*2⁶+0*2⁵+1*2⁴+0*2³+1*2²+0*2¹+0*2⁰<br>Simplify and you would get 128+64+16+4=212</p><p>This shows that 11010100(base 2)=212(base10)</p><p>Converting into larger bases would require the repeated division method but the smaller ones can work with the power method.</p><p>Special Cases:</p><p>Sometimes there can be cases where there is a very quick method in conversion. The only way for this to work is if the number’s base is a power of the base you are trying to convert that number into. For example if you were to convert a base 2 number into a base 16 number take 11010011. You can first convert the base 2 number into base 10 and then into base 16. But for these kinds of cases, the quick method can be applied. Basically if the two bases have an exponent relationship (base 2 and base 16) then you can use a logarithm.</p><p>Lets say that the 2 bases here are x and z</p><p>log (base x)z=y</p><p>What y represents here is the number in base x can be split into equal parts where in each part there are y digits in them. Those smaller chunks get converted into base 10, and those multiple smaller numbers you can convert those numbers into numerals from base z, and finally when all this is done you simply just put those base z numerals together to form the final number.</p><p>In an example featuring the number 10101100 in base 2, you can convert this number to base 16 by splitting the number given (10101100) into 4 parts. The number of parts it is spilt into is 4 because:</p><p>log(base2)16=4 or 24=16</p><p>Once the number is split into 4 equal parts 1010 and 1100, you convert these into base 10. The numbers are 10 and 12 respectively. Finally with these numbers you just have to put them in numerals of the final base you are trying to convert it in, in this case 16. In base 16, A is 10 and C is 12. Meaning that 10101100(base 2)=AC(base16)</p><p>This shortcut method can work for bases that have an exponent relationship between each other.</p><p>When converting between number bases, you use the base’s number because place values are built from powers (positive or negative exponent) of that base. For example, to convert 100(base 10) to base 11, you repeatedly divide by 11 until the quotient is smaller than the divisor. This is what it looks like:</p><p>100/11=9 r 1.</p><p>Since 9 is smaller than divisor 11, you have to put the quotient before the remainder to get your final number in this case in base 11 which would be 91(base 11) because the quotient (9) came before the remainder (1) to form the final number. Now when converting 91(base 11) back to base 10 involves multiplying by powers of 11.</p><p>Similarly, when converting from base 3 to base 5, you can use base 10 as an interval bridge for convenience but you can also convert directly by doing all the calculations in either base 3 or base 5. You do not have to use base 10; it is simply convenient because we normally do arithmetic in base 10.</p><p>For example, to convert 2113 directly into base 5, you can express the base-3 place values in base 5:</p><p>(3⁰)(base 5)= 1, (3¹)(base 5) = 3, and (3²)(base 5) = 14. Then calculate (2 × 14) + (1 × 3) + (1 × 1) = 33 + 3 + 1 = 42, with all of these calculations being done in base 5.</p><p>Thus, 211(base 3)=42(base5).</p><p>The key idea is that the bases are different ways of representing the same underlying number, and you can perform the conversion using either base as long as you correctly represent all the numbers and operations in that base. But for the sake of simplicity, arithmetic is in the simplest form when in base 10 because that is the number system we are used to.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=f112223e4878" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>