Renaissance

It deosn’t mttaer in waht oredr the ltteers in a wrod are,
the onlny ipromoatnt tihng is taht the frist and lsat ltteer
be at the rghit pclae.

.

What’s wrong with this photo ? With the ambient light it might be sometimes difficult to realize what is misleading the brain in getting it right. I tweaked with brightness/contrast of the image to get the one below. In the modified image, the light source on the top of image is more intense than others. The surface which are parallel to the light source reflect more light than the ones that are not parallel. Now the real structure becomes clear. The angle at which you view this model is must to see this illusion, else the the gap between the stubs parallel to base becomes obvious.

.

Here are two equations that are supposed to be somekind of mathematical crank. I only hope if it is true. One of the equation relates the golden ratio and pi. While second one relates pi with most of the physical constants.

Too good to be true.And finally, who said that Mathematics can be a bore. Look at the following puzzle from Mahavira from 9th century (India).

One nigt, in a month of the spring season, a certain young lady was lovingly happy with her husband in a big mansion, white as the moon, set in a pleasure garden with trees bent down with flowers and fruits, and resonant with the sweet sounds of parrots, cuckoos and bees which were all intocixcated with the noney of the flowers. Then, on  love-quarrel arising between husband and wife, her peral necklace was broken. One third of the pearls were collected by the maid-servant, one sixth fell on the bed-then half of what remained and half of what remained thereafter and again one half of what remained thereafter and so on, six times in all, fell scattered everywhere. 1,161 pearls were still left on the string; how many pearls had there been in the necklace?

If you observe a light source through glass that has lot of scratches, you can see that scratches makes a circular pattern around the light source. You move the pattern also moves. Looking out for reason.

A man finds himself on top of the castle, chased by enemies. He needs to escape before they find him. He finds a rope which is just half the height of the castle. Can he make it to the ground without getting injured?

If you have solved todays sudoko puzzle, then you can pamper your self. You have solved one of the NP class problem! All sudoku problems are of the class NP type.

    second order sudoku

I wish to know if this thing has happend to you while solving sudoku. Have you ever breezed through one of those hard sudoku problem meanwhile got your self tied in attempting to solve those medium ones ? Want to know how news papers classify the problem as easy, medium and hard ? The ones based on the givens may be misleading. Secondly did any body use second order sudoku puzzle to derive rules ?

What is NP problem : Explanation from claymath.com 

Suppose that you are organizing housing accommodations for a group of four hundred university students. Space is limited and only one hundred of the students will receive places in the dormitory. To complicate matters, the Dean has provided you with a list of pairs of incompatible students, and requested that no pair from this list appear in your final choice. This is an example of what computer scientists call an NP-problem, since it is easy to check if a given choice of one hundred students proposed by a coworker is satisfactory (i.e., no pair taken from your coworker’s list also appears on the list from the Dean’s office), however the task of generating such a list from scratch seems to be so hard as to be completely impractical. Indeed, the total number of ways of choosing one hundred students from the four hundred applicants is greater than the number of atoms in the known universe! Thus no future civilization could ever hope to build a supercomputer capable of solving the problem by brute force; that is, by checking every possible combination of 100 students. However, this apparent difficulty may only reflect the lack of ingenuity of your programmer. In fact, one of the outstanding problems in computer science is determining whether questions exist whose answer can be quickly checked, but which require an impossibly long time to solve by any direct procedure. Problems like the one listed above certainly seem to be of this kind, but so far no one has managed to prove that any of them really are so hard as they appear, i.e., that there really is no feasible way to generate an answer with the help of a computer. Stephen Cook and Leonid Levin formulated the P (i.e., easy to find) versus NP (i.e., easy to check) problem independently in 1971.

 Check out software evil post

In a certain mixed school, where a special feature was made of the inculcation of good manners, they had a curious rule on assembling every morning. There were twice as many girls as boys. Ebery girl made a bow to every other girl, to every boy and to the teacher. Every boy made a bow to every other boy, to every girl, and to the teacher. In all there were nine hundred bows made in that model academy every morning. Now, can you say exactly how many boyd there were in the school?

If you are not careful, you are likely to get a good deal out in your calculation.