Quote:
Originally Posted by Aarav Let me try to test more on this.
OK -> Assume, the number is a 2 digit and N < 100. Can we now have a unique N?
I will go a step further and talk about a famous problem. Two budding MBAs who are also mathematicians, Srikar and arbit_rageur, play a game. The computer selects two secret positive integer x, y such that x, y < 20 (both Srikar and arbit_rageur know that , but that they don't know what the value of N is). The computer tells Srikar the sum x+y, and it tells arbit_rageur the number xy . Then, Srikar and arbit_rageur have the following dialogue:
Srikar: I don't know what N is, and I'm sure that you don't know either.
arbit_rageur: Oh, then I know what the value of N is.
Srikar: Now I also know what N is.
Assuming that both Srikar and arbit_rageur speak truthfully and to the best of their knowledge, how many possible values of N are there? |
Aarav this problem is too complicated... i guess it also appeared in mind sport... am i correct?
for the other qn we just have to findout the last digit of the powers of primes less than 100 with their powers too less than 100. i will talk abt exceptions: if last digit :
2-32
3-13
4-64
5-25
6-16
7-47
8-no exception
9-49
so we check for 8:
for 48 (10 divisors), 88 (8 divisors) we get unique divisors.
so we get 3 values of the answer:
10,48 n 88
il try to attempt the advanced level qn too in sum time.