… I just realized that I have this habit of asking ambiguous questions, the answers to which necessitate further questions. For example, I was asking my friend “There won’t be any confirmation mail for the documents we submitted, right?”. If he answers just a Yes or No, I will still be left with confusion. Instead, I would have asked “Will there be any confirmation for the documents we sent?” and just an Yes or No would suffice!
If you do not ask the right questions, you do not get the right answers
I was a free electron,
I felt your potential,
Now in a bound state in your well!
Zipping through eternity,
translational invariance all around…
Isotropy finally broken,
Oh! just look who I found!!
Your radiance energizes me,
up and down I jump; you excite…
Oh see the glow, don’t you know?
My face so bright… that’s light (hv) !!!
PS: This scientific song is by ‘My Friend Mario’ inspired by this!!!
Here is the solution for the puzzle #1 that I’ve posted some days back.
Let’s divide total 10000 numbers into 1000 series, and label them from 000 to 999. For example, 000th series will have 0001, 0002, 0003, … 0000. 345th series will have 3451, 3452, 3453, … 3450. In a given xyzth series, the number xyz0 is kept at the end in order to continue looping to other series.
Let’s say I am starting with a 4 digit number wxyz. The next number that follows will be xyz*. That means, I have to select a number which belongs to xyz series, i.e, between xyz1 to xyz0. Everytime I have to select a number from a new series xyz, I will start with the first number available in that series, i.e, xyz1. Next time I come to this series, I will select xyz2, and so on. This procedure ensures that we will traverse through all the numbers in a loop. For example, if my starting number is 0001, next number belongs to 001 series. I will select 0011. Next series is 011, I will select 0111. Next series is 111, I will select 1111. Next series is again 111, and the next available number in this series is 1112. This goes on, and loops the whole set of 4-digit numbers.
If you want to try this logic manually, you can first assume that the password length is 2, and there will be 10 series, each containing 10 numbers. Maintaining a mental list for this (or scanning a string of 102 digits) is easier. Start with 01 as your first number, and do the above procedure. A pattern can be recognized.
If you want to try this logic on computer, use the following c++ code. For reference, I am also pasting the output of this code for a password length of 4. Note that this code can be used for password length varying from 2 to 10.
Download the c++ code, and output for password length of 4.
PS: One of my colleagues has solved this in a different way. I will post that answer when time permits.
A: Last night, I had bad sleep.
A: I don’t know. It was very disturbing sleep 😦
B: That means, your cache is not cleared properly 😉
A: Hmmm… I think I have to empty my trash bin too
B: Yes, if that’s possible! Also, see if any unwanted processes running during sleep time
A: correct… how about an anti-virus?
B: Anti-virus? Get married… you won’t have time to sleep at all. Then no question of disturbed sleep 😉
A: Huh… not again!
A: Looks like I have constipation 😦
B: It must be due to bad reaction inside. Some of the reactions must have gone wrong and caused imbalance in the food rate equation. It’s all in the rate equation dude!
A: So, what’s the solution?
B: One possible solution is to try changing the reaction rate. Technically, a tablet can do the job.
A: And what’s the other?
B: Forceful purging of the unwanted reagent 😉
A: Hmmm… I may not consider that option
B: Hey wait, there is another way. Fluid Mechanics say that lubrication enhances the conduit flow. Why don’t you add some lubricant?
B: Something like castor oil??
A: Come on man… stop it! I think this whole geeky thing worked. I have to go to…….
B: All the best 😉
Here is a nice puzzle.
You want to open a door, which is password protected. The password is a 4-digit numeric string. You don’t know the password. But, you are free to enter as many digits as you wish. No matter how lengthy the numeric string that you enter, if the actual password exists anywhere in the string, the door opens. For example, if the password is 1234 and you enter 12345, or 42351234, or 3423123465, the door opens! I guess, now the conditions are clear. With this set of rules, with a dump attempt, you can enter all possible 4- digit numbers (starting from 0000 to 9999) and get it open. But, the puzzle here is to obtain a string of minimum possible length, which encompasses all the possible 4-digit numeric strings.
- As you can see, the first 4-digit string needs 4 numbers. After that you find a new 4-digit string by just adding one more number at the end of it. So, in order to traverse between all the 10000 possible passwords, without repetitions, the minimum length of the string (that you are going to discover) will be 3+10*4
- Of course, that means you have to find a string of 10003 digits. But, you don’t need to write down the whole string. Once you crack the puzzle, just write down the algorithm to generate the string.
You can send your answers to me at gopoo.1981 @ gmail.com or you can post in the comment.
PS: Even I haven’t solved this puzzle completely, but I am close to it (at the cost of sleepless night yesterday). If everything goes fine, I will post a descriptive answer sometime in the next week.
Many a times, this question disturbs me. I guess, there must be many more who have this question in mind. So far, I haven’t got a convincing answer. I read in the book “chivariki migiledi” that there is no absolute meaning (or rather point) for life. It’s the journey of life and the quest to answer these questions, is all that matters. Enjoy the journey while learning to progress in the journey. In general, when time goes busy, even in tough situations, I never get this question into mind. But, unfortunately, when times goes leisurely and everything is going smoothly, this question troubles me and makes my time tough 😉 Coming out of the serious side of the question, my friend Mario has answered to me in the following way. Seriously, it made my day!