Hello all,who visit this forum often. I am trying to solve one problem but failed.The problem goes in the following fashion.
f{f(x,y),f(y,x)}=1-f(x,y);f(1,1)!=1;f(1,1)=?
is it 3 ??
Hello all,who visit this forum often. I am trying to solve one problem but failed.The problem goes in the following fashion.
f{f(x,y),f(y,x)}=1-f(x,y);f(1,1)!=1;f(1,1)=?
No the answer is 1/2.Thanks for the try.
Rupam,
1/2 is not a possible answer.Please re confirm.This might be 0
regards,
nayan
.
I have not solved the problem myself.Actually it was sent to the mail box of one of my friend from this particular website.But they have not provided him with the solution but only the answer and it is indeed 1/2.
Thanks
If a0 = 2, a1 = 1 and a n + 1 a n 1 = a n 1 a n + 1, then find the value of a1000.
(1) 1/1001
(2) 1/2002
(3) 1/2
(4) 2/1001
(5) 3/1003
If a#0 = 2, a#1 = 1 and a #(n + 1) a #(n 1) = a #(n 1) a #(n + 1), then find the value of a#1000.
(1) 1/1001
(2) 1/2002
(3) 1/2
(4) 2/1001
(5) 3/1003
*digits and exp after # are subscripts
If a#0 = 2, a#1 = 1 and a #(n + 1) a #(n - 1) = a #(n - 1) - a #(n + 1), then find the value of a#1000.
(1) 1/1001
(2) 1/2002
(3) 1/2
(4) 2/1001
(5) 3/1003
*digits and exp after # are subscripts
Hello all,who visit this forum often. I am trying to solve one problem but failed.The problem goes in the following fashion.
f{f(x,y),f(y,x)}=1-f(x,y);f(1,1)!=1;f(1,1)=?
Hi I need the explanation for solving this problem from progressions:
sum to n terms of the series:8 + 88 + 888 + ....
it will be really nice if someone can help.
Hi I need the explanation for solving this problem from progressions:
sum to n terms of the series:8 + 88 + 888 + ....
it will be really nice if someone can help.
hey thanks!!
got an another problem in progression:
sum of 1.2 + 2.2^2 +3.2^3+.......+100.2^100??
Find the maximum value of n such that 157! is perfectly divisible by 18^n .
Answer is 37.
Please show the steps.
Thanks!
hey thanks!!
got an another problem in progression:
sum of 1.2 + 2.2^2 +3.2^3+.......+100.2^100??
Find the maximum value of n such that 157! is perfectly divisible by 18^n .
Answer is 37.
Please show the steps.
Thanks!
Find the maximum value of n such that 157! is perfectly divisible by 18^n .
Answer is 37.
Please show the steps.
Thanks!
Please provide explanation for the below question:
A wall clock gains 2 min in 12 hrs while a table clock loses 2 mins in 36 hrs;both are set right at noon on tuesday.The correct time when they both show the same time next would be
a) 12:30 night b)12 noon c)1:30 night d) 12 night
After 36 hrs
Wall-12.06 night
Table-11.58 night
They will meet,when 12 hours are covered between them.
36 hrs=>8 mins
x hrs=>720 mins
x=3240 hrs
x=135 days
So,12 noon.
Is the answer correct?
Test has 80 questions
each wrong question -1/2
each not attempted question -1/4
final score is 34.5.
How many questions are right?
Test has 80 questions
each wrong question -1/2
each not attempted question -1/4
final score is 34.5.
How many questions are right?
- 45
- 48
- 54
- can not be determined.