## Number Puzzle #181

If

2×3=15

2×5=20

2×7=30

2×11=?

Difficulty Level – Very Difficult

If

2×3=15

2×5=20

2×7=30

2×11=?

Guess the classical raaga from these whatsapp emoticons

If 1*36=36

8*23=23

8*67=1

Then

9*10=?

**Number Puzzle #67**

First lets understand the pattern

4+5+4+5 => 18 => 1+8 => 9 => square of 9 => 81

5+6+5+6 => 22 => 2+2 => 4 => square of 4 => 16

6+7+6+7 => 26 => 2+6 => 8 => square of 8 => 64

4+5+4+5 => 18 => 1+8 => 9 => square of 9 => 81

5+6+5+6 => 22 => 2+2 => 4 => square of 4 => 16

6+7+6+7 => 26 => 2+6 => 8 => square of 8 => 64

Thus the patter is sum of the digits till we get single digit and then square of the the single digit.

**Method 1:**

So lets assume the missing number is x

thus 1+2+1+x = x + 4

Now if x is less then or equal to 5(i.e. x+4 is single digit)

(x+4)(x+4) = 16 =>** x = 0**

Now if x is greater then 5( i.e. x + 4 is two digit number)

lets replace x by 6+y (where y is single digit)

x+4 => 6+y+4 => 10 + y => y +1 => (y+1)*(y+1) = 16 => y = 3

**thus x = 6+y = 9.**

**Note:** If we assume missing number can be more then single digit.

**Method 2:**

its the reverse engineering method => to get 16 the sum of digits should be 4

we already have 1+2+1 = 4 thus missing number can be 0

other ways to get the sum of digits as 4 => 13, i.e. missing number = 13-4 = 9

other ways is 22, i.e. missing number 22-4 = 18

other way is 31, i.e. missing number 31 – 4 = 27

other way is 40, thus missing number 40 -4 = 36

so there can be more such numbers

If 3 men are illiterate one is deaf one is blind one is dumb. blind’s wife kidnapped by deaf than

**how will the dumb tell this to blind?**

[Read more…]

One day a man woke up from sleep to find that he was at an unknown place away from his home.He walked certain distance to reach a bifurcation.Two roads bifurcated at that point one would lead him to his home and the other would lead him to certain death…now his dilemma was this…two man stood at each road.one would always speak truth, the other always lie.They informed him that he could ask just one question to any of them but did not tell him who was who.So,**what question he would had asked to reach home safe ?**

There are n bulbs in a circle, each bulb has one switch associated with it, on operating the switch, it toggles the state of the corresponding bulb as well as two bulbs adjacent to that one. Given all bulbs are in off state initially, give a plan to turn all bulbs on finally.

Note: n >= 1.

[Read more…]

From 2011 facebook is organizing a Facebook hacker cup every year around feb, visit Facebook hacker cup homepage for more details

This question is the third question(Carried 45 marks out of 100) for the Round 2 of 2013 hacker cup. only top 100 contestants will be moved to Round 3.

In this problem you need to count number of possible permutations **p** of the first **N** integers, given **N-1** constraints of the form **p _{i} < p_{j}.**

The first line contains an integer **T**, **T** ≤ 20, followed by **T** test cases. Each test case begins with an integer **N**, **N** ≤ 1000, which is the number of integers in the permutation. The next **N – 1** lines each contain a single constraint in the following format: “**i** **sign** **j**“, where 0 ≤ **i**, **j** ≤ **N – 1** and **sign** is either “**<**” or “**>**“, which denotes whether the **i**-th element of the permutation should be less than or greater than the **j**-th element.

It is guaranteed that it is not possible to partition indices into two disjoint sets A and B such that there is no constraint involving elements from both A and B.

[Read more…]

From 2011 facebook is organizing a Facebook hacker cup every year around feb, visit Facebook hacker cup homepage for more details

This question is the third question(Carried 45 marks out of 100) for the qualification round 2013 hacker cup.

After sending smileys, John decided to play with arrays. Did you know that hackers enjoy playing with arrays? John has a zero-based index array, **m**, which contains **n** non-negative integers. However, only the first **k** values of the array are known to him, and he wants to figure out the rest.

John knows the following: for each index **i**, where **k** <= **i** < **n, m**[**i**] is the minimum non-negative integer which is *not* contained in the previous ***k*** values of **m**.

[Read more…]