Published:
Cypherpunks write code (A Cypherpunk’s Manifesto - Eric Hughes, 1993). Therefore, I want to work through various problems from Project Euler and Cryptopals. However, currently, I can’t code proficiently in any language.
Published:
Following is the comparison of tech specs of my new tablet (USD 315 + taxes) with the older tablet (USD 280 + taxes):
Published:
In this post I discuss the options available for doing computational experiments in advanced number theory.
Published:
In this post I have collected the options available for embedding vector graphics in LaTeX when using pdfLaTeX.
Published:
In this post I have written down the steps one can follow to use the Terminal Emulator as a versatile LaTeX editor. A good reference for learning LaTeX is “The not so Short Introduction to LaTeX.”
Published:
My quest to find the best Linux distro for the new PC.
Published:
My quest for building a cheap PC capable of running Linux, especially LaTeX.
Published:
My quest for buying a cheap lightweight laptop that can run Linux and backup data efficiently.
Published:
Consider the following example from Piskunov’s “Integral and Differential Calculus”:
Published:
In this post I would like to share my old writeup about there existence of a continuous surjective map from $\mathbb{R}$ to $\mathbb{R}^2$. In other words, we will prove that that Hilbert’s Curve is a continuous surjective map. The proof presented here was explained by Dr. Manas Ranjan Sahoo, 3 years ago on 15th April 2016.
Published:
In 1852, Chebyshev proved the Bertrand’s postulate:
Published:
These are the two lesser known number systems, with confusing names.
Published:
The problem has finally been solved by Matthew Scroggs.
Published:
This has been an exciting week! Prof. Sukanta Pati proved an interesting theorem that enables us to get decomposition of $2m-1\times n$ grids into simpler grids, hence simplifying counting to large extent (note that $m=n$ is also allowed). It enables us to surpass the difficulty posed by “more than two crosses in one square”, thus supporting the idea of colouring (i.e. not giving importance to two crosses in a square).
Published:
While discussing this problem with Dr. Shailesh Shirali, he commented that there has to be a way to phrase the problem in terms of a ray of light being reflected off the walls of the rectangle, bouncing around, proceeding from one corner to some other corner.
Published:
I found many counterexamples to my conjecture, like
Also, grant93jr made the following comment:
Published:
I will continue the previous post. Now the question to be answered is that:
Published:
While doodling in my college classes, I designed an algorithm which I called Cross Diagonal Cover Algorithm:
Published:
Many of you must have seen numerous examples of such situations where we get an absurd result and have to spot flaw in proof.
Published:
Here is my first post.