1yes correct:)
Two mathematician are A&B plays a co-operative game.The computer selects some secret positive integer n less than 60 (both knows that n<60 but they dont know its value) .the computer tells the unit digit of number to A and tells B the no. of divisors of n.then A&B have made following statements:
A:-"i dont know what n is and i'm sure that u dont know either.However ,i know that n is divisible by at least 2 different prime nos."
B:-"Oh,then i know whats the value of n is!"
A:-"Now,i also know what the value of n is"
Assuming that both speaks the truth and the best of their knowledge.What are/is possible value of n??
-
UP 0 DOWN 0 0 7
7 Answers
49seeing the units digit the mathematician says that the number must be divisible by at least two different prime numbers.
this implies that the unit's digit must surely be 0.
now,
possible answers 10=4 divisors
20=6
30=8
40=8
50=6
iske aagey i am so far confunded :P
49ok...now i have answer...
so as the second mathematician is sure of the answer...the number of divisors must have been 4.
SO ANSWER IS 10!!
I DEMAND A PINK FOR THIS :P:P kidding :D
1It can be 6, which is multiplied by 2 and 3.
it can be --
15, 35, 45, 26, 39
Just according to the A's hint.......
1how did you kno dat if last digit is 6 then it divisible by 3....unless u kno the sum of digit.
and 5 is itself prime so how can it be ever divisible by 2 distinct prime!!!
1My game is Flip a Coin. There will be two players A and B with deck of cards. The person who gets heads can draw a card from the deck of cards and points are awarded based on the card. If the drawn card is A, 11 points are awarded.If its K,Q or J, 10 points are awarded. If the player gets any other card, points are awarded based on card number. Either A or B can win the game or it can be a tie. And based on who wins the game highest score,least score and average score are recorded.
The output of the program should be whether A wins or B wins or is it a tie
whats the maximum score.
whats the minimum score.
whats the average score.
6oops
that wud be pretty lengthy , isnt it??
a couple of cases to be formed!!
:O