Puzzle_4

1. A father is talking with his son about his fat's age. He said that "My father was 8 yr at the X power 2 year. ". "Dont confuse boy , it was 20 th century". What is the yr boy's GF born.

Solution: Granpa was borned in 20 th century i.e 1900-2000 When he was 8 Yrs old then the year was square of a number X. Since only the square of number 44 is the number that defines the year in between 1900 and 2000 and its 1936. Since the granpa of boy was 8 yrs old so the original year of birth will be 1928.

2. There r some groups and lodges. And there have given some conditions. Depending onthis we have to find how many lodges and how many men in each group.
1. Each person belongs to exactly 2 lodges.
2. One loge is associated with exactly 3 members
3. Any pair of lodges consists of exactly one common person from a group.

Solution: Suposs L denotes lodges and P denotes persons then L1 has P1,P2,P3 L2 has P1,P4,P5 L3 has P2,P4,P6 L4 has P3,P5,P6 so ans is 4 lodges and 6 person

3. In a county , the basketball tournament was succeeded by Doubly eliminating process. If one team loses two matches , it will be disqualified] so if there are 51 teams then what will be the max no of matches.

Solution : It is n + (n-1) , in this case n is 51. Here is the explanation: say it is like a playoff tournament (each team is allowed to enter next round if it wins) then between 2 teams to decide a winner we play 1 game, if there are 3 teams we need to play 2 games, if it is 4 teams then 3 games and so on...
but since here it is two losses that disqualifies a team, and we are considering the maximum possible (worst case scenario) , if there are 2 teams and each team wins 1 game, then the third game is the decider, similarly if there are 3 teams, allow each team to play with all the other teams once first (3 games, which means 3 wins and 3 loses) lets assume each team 1 game and lost 1 (this results in the worst case scenario again) and during the second iteration, two games are enough ( 2 wins, 2 loses) and we have a winner here ....
hence the final answer is n + (n-1)