gnehagarg
(A B)
January 19, 2013, 7:43am
14763
@PURITAN said: remainder when 128^1000 is divided by 153 ??
153=9*17
128^1000mod 9= 2^1000=(2^3)^333*2=-2 or 7
128^1000 mod 17=9^1000mod 7=(9^4)^250 =1
9x+7=17y+1
y=3
52 remainder
gnehagarg
(A B)
January 19, 2013, 7:55am
14764
@pirateiim478 said: 13x+13y+13z=117 x+y+z=9 =>11C2 =55 ordered solutions What is the largest sum of rupees which can never be paid using infinite number of coins of denominations Rs. 5, Rs. 7 and Rs. 11?
Every number greater than 13 can be formed
5=4k+1
7=4k-1
11=4k-1
logrhythm
(xenophobic anonymity )
January 19, 2013, 7:57am
14765
@PURITAN said: remainder when 128^1000 is divided by 153 ??
153 = 9*17
128^1000%9 = 2^1000%9
e(9) = 6
100%6 = 4
=> 2^4%9 = 7
similarly -> 9^8%17 = (-4)^4%17 = 1
hence, remainder -> 9x+7=17y+1
so 52....
logrhythm
(xenophobic anonymity )
January 19, 2013, 8:00am
14766
@ravi.theja said: The HCF of three natural nos x,y,z is 13. if the sum of x,y,z is 117 then how many ordered pairs of (x,y,z) exist?
13(x+y+z) = 117
x+y+z = 9
x'+y'+z' = 6
8c2 = 28
but we need to take out x=y=z=3
hence, total = 28-1 = 27 cases...
gnehagarg
(A B)
January 19, 2013, 8:18am
14767
@TootaHuaDil said: (3^1024-1)/2^n then find the highest value of n which will divide this..
(3^1024)-1
(1+2)^1024-1
1+1024C1*2+1024C2*2^2+1024C3*2^3+------------------+2^1024-1
1024C1*2+1024C2*2^2+1024C3*2^3+-----------------------+2^1024
Minimum is 1024*2=2^11
logrhythm
(xenophobic anonymity )
January 19, 2013, 8:27am
14770
@TootaHuaDil said: (3^1024-1)/2^n then find the highest value of n which will divide this..
answer wld be 12...
3^1024 - 1 = 9^512 - 1 = (8+1)^512 - 1 = 8^512 + ..... + 512c2*8^2 + 512c1*8 + 1 - 1 = 8^512 + ..... + 512c2*8^2 + 512c1*8
the last term has 2^12
logrhythm
(xenophobic anonymity )
January 19, 2013, 8:37am
14773
@vbhvgupta said: Q1
let n =1
so A = 1 and B = 3/2
hence, A/B = 2/3 (option C)
logrhythm
(xenophobic anonymity )
January 19, 2013, 8:43am
14775
@vbhvgupta said: Q2
10??
sigma (n=1 to 120) 1/(rt(n) + rt(n+1))
catahead
(Sachin Verma)
January 19, 2013, 8:45am
14777
@vbhvgupta said: Q2
Rationalise the denominator by multiplying, You you get [ root(1)-root(2)+root(2)-root(3)+....+root(120)-root(121) ] / (-1 = root(1) - root(121) / -1 = 10
catahead
(Sachin Verma)
January 19, 2013, 8:48am
14778
@vbhvgupta said: Q1
A=4/3[1-1/4^n] B=2(1-1/2^2n]=2(1-1/4^n] So A/B=2/3
mailtoankit
(ankit gupta)
January 19, 2013, 9:23am
14780
@vbhvgupta said: Q2
10?
-(1-rt2+rt2-rt3+.......rt120-rt121)
-(1-rt121)
-(1-11)=10
gnehagarg
(A B)
January 19, 2013, 9:23am
14781
@vbhvgupta said: Q2
rt2-rt1+rt3-rt2+rt4-rt3+------------------------+rt121-rt120
-rt1+rt121
10
the_loser
(CAT Bang)
January 19, 2013, 9:32am
14782
hw many 6 digit no are dre having 3 odd & 3 even digits?