x^y+y^x=5298.If x and y are integers find x and y.
You have 13 balls which all look identical. All the balls are the same weight except for one. Using only a balance scale, can find the odd one out with only 3 weighings? Is it possible to always tell if the odd one out is heavier or lighter than the other balls?
rambo works in the security section of a bank.everybody in the company is either an IT person or a finance person or both.the assignment that rambo is currently working on has five people from finance and three people from IT,including him.of the 26 finance people in his department,a total of 16 are in his section.of the 18 IT people in his department,10 are not in rambo section.there is nobody in rambo section who is both a finance person and an IT person.fifteen people in his department do not belong to his section... 1)how many IT people are there in rambo's department who are not a finance person and are not in rambo's section? A)1 B)3 C)5 D)8 2)what number finance people in rambo's department are not in his section? A)26 B)10 C)21 D)16 3) what is the total number of people who come under rambo's department? A)51 B)45 C)40 D)39 4)how many people in the department are both IT and finance persons? A)0 B)5 C)3 D)7 i face this question
justify 1-1=11...
A_basket_has_six_eggs_in_it_Six_people_come_along_and_each_tak es_an_egg_but_there_is_still_one_egg_left_in_the_basket?how?
Mrs. F has invited several wives of delegates to the United Nations for an informal luncheon. She plans to seat her 9 guests ina row such that each lady will be able to converse with the person directly to her left and right. She has prepared the following list. Mrs. F speaks English only. Mrs. G speaks English and French. Mrs. H speaks English and Russian. Mrs. J speaks Russian only. Mrs. K speaks English only. Mrs. L speaks French only. Mrs. M speaks French and German. Mrs. N speaks English and German. Mrs. O speaks English only. How many distinct seating arrangements are possible? Give all possible seating arrangements. Note that ABCD and DCBA are the same.
Arrange these words into a romantic word D P G E O D S?
Tanya wants to go on a date and prefers her date to be tall, dark and handsome. 1. Of the preferred traits - tall, dark and handsome - no two of Adam, Bond, Cruz and Dumbo have the same number. 2. Only Adam or Dumbo is tall and fair. 3. Only Bond or Cruz is short and handsome. 4. Adam and Cruz are either both tall or both short. 5. Bond and Dumbo are either both dark or both fair. Who is Tanya's date?
Write 1111......(243 times) i.e. a 243 digit number with all 1s. Prove that it is divisible by 243.
There is a bucket with lots of marbles. Some are red, some are blue, some are green and some are orange. We don't know the quantity of any. With your closed eyes how many minimum number of marbles you will pick so as to 100% sure that atleast 2 marbles have the same colors.
Replace each letter by a digit. Each letter must be represented by the same digit and no beginning letter of a word can be 0. O N E O N E O N E + O N E ------- T E N Use trial and error. 0 =1, N = 8 ,E = 2, T = 7 1 8 2 1 8 2 1 8 2 + 1 8 2 ------ 7 2 8 A man is on a search for Atlantis and comes upon an island where all the inhabitants know whether Atlantis is still around or not. However, all of the inhabitants are either Fairies or Trolls and they all use a spell to appear humanoid so you cannot tell which is which. And the Faries always tell the truth and the Trolls always lie, but there is a slight complication, some of the Fairies have gone insane and always lie and some of the Trolls have also gone insane and always tell the truth. So here is your task: you must ask the first inhabitant that you come to ONE question and from that ONE question you must determine wether Atlantis is still around or not. What is the question that you must ask?
Given a sequence of integers, there are a few sequences which result in balanced binary search trees i.e., AVL trees. Write a program that takes a sequence of integers as input and outputs the number of such sequences that result in the balanced binary search trees. Input Format: Single line contains sequence of integers terminated by -1. Output format: Print the number of AVL tree possible from that input sequence. Sample Input: 1 2 3 -1 Sample Output: 2
A man loses 20% of his money and after spending 70% of the remainder he is left with Rs. 270. Originally he had
15 Answers HZL, Times Today, Vedanta, Zoho,