While reading John Derbyshire’s Prime Obsession I came across the following statement (clearly explained on pp. 74):

Any positive power of eventually increases more slowly than any positive power of .

It is easy to prove this (existence) analytically, by taking derivative to compare slopes. But algebraically it implies that (for example):

There are either no real solution or two real solutions of the equation

for any given .

Now the question that arises is “How to find this ?” I had no idea about how to solve such logarithmic equations, so I took help of Google and discovered this Mathematic.SE post. So, we put and re-write the equation as:

Now to be able to use Lambert W function (also called the product logarithm function) we need to re-write the above equation, but I have failed to do so.

But using WolframAlpha I was able to solve to get (which is an imaginary number, i.e. no real solution of this equation) but I was not able to figure out the steps involved. So if you have any idea about the general method or the special case of higher exponents, please let me know.

Following is a very common arithmetic puzzle that you may have encountered as a child:

Express any whole number using the number 2 precisely four times and using only well-known mathematical symbols.

This puzzle has been discussed on pp. 172 of Graham Farmelo’s “The Strangest Man“, and how Paul Dirac solved it by using his knowledge of “well-known mathematical symbols”:

This is an example of thinking out of the box, enabling you to write any number using only three/four 2s. Though, using a transcendental function to solve an elementary problem may appear like an overkill. But, building upon such ideas we can try to tackle the general problem, like the “four fours puzzle“.

This post on Puzzling.SE describes usage of following formula consisting of trigonometric operation and to obtain the square root of any rational number from 0:

Recently I completed all of my undergraduate level maths courses, so wanted to sum up my understanding of mathematics in the following dependency diagram:

I imagine this like a wall, where each topic is a brick. You can bake different bricks at different times (i.e. follow your curriculum to learn these topics), but finally, this is how they should be arranged (in my opinion) to get the best possible understanding of mathematics.

To explain the mathematics behind the construction of these pictures I will quote Roger Penrose from pp. 34 of “The Road to Reality“:

Think of any circle in a Euclidean plane. The set of points lying in the interior of this circle is to represent the set of points in the entire hyperbolic plane. Straight lines, according to the hyperbolic geometry are to be represented as segments of Euclidean circles which meet the bounding circle orthogonally — which means at right angles. Now, it turns out that the hyperbolic notion of an angle between any two curves, at their point of intersection, is precisely the same as the Euclidean measure of the angle between the two curves at the intersection point. A representation of this nature is called conformal. For this reason, the particular representation of hyperbolic geometry that Escher used is sometimes referred to as the conformal model of hyperbolic plane.

If you want to brush up your high school geometry knowledge, then KhanAcademy is a good place to start. For example, I learned a new proof of Pythagoras Theorem (there are 4 different proofs on KhanAcademy) which uses scissors-congruence:

Theorem 1: The sum of interior angles of an n-gon is .

Theorem 2: The number of ways in which a convex n-gon can be divided into triangles by non-intersecting diagonals is given by

Theorem 3: Given a , with straight lines drawn through its vertex , cutting the triangle into smaller triangles . Denote by and respectively the radii of the inscribed and circumscribed circles of these triangles (all the circumscribed circles are inscribed within the angle of the triangle) and let and be the radii of the inscribed and circumscribed circles (respectively) of the itself. Then

Theorem 4: Any convex n-gon which is not a parallelogram can be enclosed by a triangle whose sides lie along three sides of the given n-gon.

Theorem 5 (Levi’s Theorem): Any convex polygon which is not a parallelogram can be covered with three homothetic polygons smaller than the given one.

The above theorem gives a good idea of what “combinatorial geometry” is all about. In this subject, the method of mathematical induction is widely used for proving various theorems. Combinatorial geometry deals with problems, connected with finite configurations of points or figures. In these problems, values are estimated connected with configurations of figures (or points) which are optimal in some sense.

Theorem 6 (Newton’s Theorem): The midpoints of the diagonals of a quadrilateral circumscribed about a circle lie on one straight line passing through the centre of the circle.

Theorem 7 (Simson’s Theorem): Given a inscribed in the circle with an arbitrary point on this circle. Then then feet of the perpendiculars dropped from the point to the sides of the are collinear.

We can extend the above idea of Simson’s line to any n-gon inscribed in a circle.

Theorem 8: A 3-dimensional space is divided into parts by planes, each three of which intersect and no four of which have a common point.

Theorem 9: Given spheres in 3-dimesnional space, each four of which intersect. Then all these spheres intersect, i. e. there exists a point belonging to all the spheres.

Theorem 10 (Young’s Theorem): Given points in the plane such that each pair of them are at a distance of at most 1 from each other. Then all these points can be enclosed in a circle of radius .

I won’t be discussing their proofs since the booklet containing the proofs and the detailed discussion is freely available at Mir Books.

Also, I would like to make a passing remark about the existence of a different kind of geometry system, called “finite geometry“. A finite geometry is any geometric system that has only a finite number of points. The familiar Euclidean geometry is not finite because a Euclidean line contains infinitely many points. A geometry based on the graphics displayed on a computer screen, where the pixels are considered to be the points, would be a finite geometry. While there are many systems that could be called finite geometries, attention is mostly paid to the finite projective and affine spaces because of their regularity and simplicity. You can learn more about it here: http://www.ams.org/samplings/feature-column/fcarc-finitegeometries

While reading Lillian Lieber’s book on infinity, I came across an astonishing example of infinite set (on pp. 207). Let’s call the property of existence of a rational number between given two rational number to be “beauty” (a random word introduced by me to make arguments clearer).

The set of rational numbers between 0 and 1 are arranged in ascending order of magnitude, and all of them are coloured blue. This is clearly a beautiful set. Then another another set of rational numbers between 0 and 1 is taken and arrange in ascending order of magnitude, but all of them are coloured red. This is also a beautiful set. Now, put these two sets together in such a way that each blue number is immediately followed by the corresponding red number. For example, 1/2 is immediately followed by 1/2 etc. It appears that if we interlace two beautiful sets, the resulting set should be even more beautiful. But since each blue number has an immediate successor, namely the corresponding red number, so that between these two we can’t find even a single other rational number, red or blue, the resulting set is NOT beautiful.

The set created above is called Huntington’s Red-Blue set. It is an ingenious invention, where two beautiful sets combined together lead to loss of beauty. For more details, read the original paper: