Quant by Arun Sharma

N = 202 x 20002 x 200000002 x 2..(15 zeros)..2 x 2 ...(31 zeros) ...2 sum of the digits in this multiplication is
Individual digit sum = 4
4^5 = 1024. = 7 check from options...160 has a digit sum of 7 so the answer or else u can go by traditional way

= (202*20002) = 4040404 = 16
so going by the tresnd the answwer willl be 160

for second question check the terms i think u have committed the typo eerror


ya first ans is correct ..

and i am sorry for the type error..here is ques..

10^n+(5+(17)^1/2)^n is divisible by 2^(n+2) for what whole no value of n??
10^n+(5+(17)^1/2)^n is divisible by 2^(n+2) for what whole no value of n??


just subsitute the values and n = 4 satisfies the equation so none of these

2 ques more..

what is remainder when 50^56^52 is divided by 11.

option. 7,,5,9,10.


&

how many integer value of x & y satisfy the equation 4x+7y=3 where
mod(x)
option are
284, 285,286 , none of these

2 ques more..

1.what is remainder when 50^56^52 is divided by 11.

option. 7,,5,9,10.

mod 11

EN(11) = 10

so 50^56 reduces to 50^6

50^6 mod 11 which is 36*36 *36 mod 11 => 3*3*3 => 27 ...so remainder is 5

2.how many integer value of x & y satisfy the equation 4x+7y=3 where
mod(x)
option are
284, 285,286 , none of these
x = /4

so possibilities for x to be integer with in

-1000
y = 1,5,9,13,17........

y = /7

x = -1,-8,-15......

when y = 142 x is -993 so
x also take 142 values

so thr vil be 284 values ...
mod 11

EN(11) = 10

so 50^56 reduces to 50^6??? how did u got this as 10 ,50 are not co- prime.

50^6 mod 11 which is 36*36 *36 mod 11 => 3*3*3 => 27 ...so remainder is 5

..


50^56 reduces to 50^6??? how did u got this as 10 ,50 are not co- prime.
vivek.k.singh Says
50^56 reduces to 50^6??? how did u got this as 10 ,50 are not co- prime.

10 ,50 are not co- prime but the point is that 50 and 11 are co prime

What should be subtracted from each of the numbers 53,71,75 and 99 , so the remainders are proportional ?

3
4
5
6

please give detail solution

Six men A,B,C,D,E,F agree with a seventh man G to provide a sum of money among them . A,B,C,D,E,F are to subscribe rs.10 each ,and G is to pay rs 3 more than the average of the seven . what is the whole sum to be provided ?

rs 73.50
rs.74
rs 73
rs 72.50

three people A,B,C weigh themselves in particular order . First A,B,C weigh themselves individually and then AB,BC, CA and ABC together respectively . the recorded weight for the last measure is 180 kgs. The average of the 7 measures is :

320 kgs
360/7 kgs
720/7 kgs.
cant be determined

A certain number of trucks were required to transport 60 tons of steel wire from factory . However, it was found that since each truck could take 0.5 tons of cargo less, another 4 trucks were needed . how many trucks were initially planned to be used ?

10
15
20
25

Can some one do this question with detailed solution..
a and b have some marbles with each of them, such that the no. of marbles with b is twice that with a. If b distributes her marbles equally among certain no of bags, she is left with 41 marbles. If both a and b pool their marbles and then distribute among same no. of bags, they are left with 10 marbles. What is the least possible no. of marbles with a and b together, given that a has at least 1000 marbles?
a. 3051
b. 3081
c. 3174
d. 3297
::

What should be subtracted from each of the numbers 53,71,75 and 99 , so the remainders are proportional ?

3
4
5
6

please give detail solution


u shd do this question by checking option...

when you take 4 as a ans.. uget

49(7^2),67(prime),71(prime),95(multiple of 19 &5)
Six men A,B,C,D,E,F agree with a seventh man G to provide a sum of money among them . A,B,C,D,E,F are to subscribe rs.10 each ,and G is to pay rs 3 more than the average of the seven . what is the whole sum to be provided ?

rs 73.50
rs.74
rs 73
rs 72.50


6*10+(x/7+3)=x, where x is total sum. hence x=73.50

three people A,B,C weigh themselves in particular order . First A,B,C weigh themselves individually and then AB,BC, CA and ABC together respectively . the recorded weight for the last measure is 180 kgs. The average of the 7 measures is :

320 kgs
360/7 kgs
720/7 kgs.
cant be determined


here ABC =180 means... A+B+C=180..

hence total average will be 4(A+B+C)/7= option c


A certain number of trucks were required to transport 60 tons of steel wire from factory . However, it was found that since each truck could take 0.5 tons of cargo less, another 4 trucks were needed . how many trucks were initially planned to be used ?

10
15
20
25


x*y=60
(x+4) *(y-0.5)=60

where x is no of truck, y is tons /truck..solve u will get it..
Can some one do this question with detailed solution..
a and b have some marbles with each of them, such that the no. of marbles with b is twice that with a. If b distributes her marbles equally among certain no of bags, she is left with 41 marbles. If both a and b pool their marbles and then distribute among same no. of bags, they are left with 10 marbles. What is the least possible no. of marbles with a and b together, given that a has at least 1000 marbles?
a. 3051
b. 3081
c. 3174
d. 3297

Kindly re check the options. According to me none of them fit. If there is none of these, then I think thats the answer. My way of solving:
Let no. of marbles with a be x, then with b will be 2x
total 3x
For all options make set of marbles
a b
opt1 1017 2034
opt2 1027 2054
opt3 1058 2116
opt4 1099 2198
Now as the second case says, after they both pool in their marbles, and divide by the same number of bags, they will be left with 10. That means in each case, 3041, 3071, 3164 and 3287 will get properly distributed. Also, when b divides her marbles, then in each case 1993, 2013, 2075 and 2157 marbles get distributed properly in the same number of bags. Therefore, the two numbers in each case should have a common factor (minimum 1) but as you can see, 3041 is a prime, so first case neglected. 3071 has factors 37,83 none of whom are common with 2013 and so on for each case. Thus, no solution matches.
Another way could be through equations.
N1*y + 41 = 2*x and N2*y + 10 = 3*x (first one for b, second for both. N1 and N2 are different numerators and y is the number of bags)
Solving we get, y = 103
As 103 is prime, y has to be either 1 or 103. We can make cases and solve, but still we do not get any solution. Hence, please check options.
Can some one do this question with detailed solution..
a and b have some marbles with each of them, such that the no. of marbles with b is twice that with a. If b distributes her marbles equally among certain no of bags, she is left with 41 marbles. If both a and b pool their marbles and then distribute among same no. of bags, they are left with 10 marbles. What is the least possible no. of marbles with a and b together, given that a has at least 1000 marbles?
a. 3051
b. 3081
c. 3174
d. 3297

Kindly re check the options. According to me none of them fit. If there is none of these, then I think thats the answer. My way of solving:
Let no. of marbles with a be x, then with b will be 2x
total 3x
For all options make set of marbles
a b
opt1 1017 2034
opt2 1027 2054
opt3 1058 2116
opt4 1099 2198
Now as the second case says, after they both pool in their marbles, and divide by the same number of bags, they will be left with 10. That means in each case, 3041, 3071, 3164 and 3287 will get properly distributed. Also, when b divides her marbles, then in each case 1993, 2013, 2075 and 2157 marbles get distributed properly in the same number of bags. Therefore, the two numbers in each case should have a common factor (minimum 1) but as you can see, 3041 is a prime, so first case neglected. 3071 has factors 37,83 none of whom are common with 2013 and so on for each case. Thus, no solution matches.
Another way could be through equations.
N1*y + 41 = 2*x and N2*y + 10 = 3*x (first one for b, second for both. N1 and N2 are different numerators and y is the number of bags)
Solving we get, y = 103
As 103 is prime, y has to be either 1 or 103. We can make cases and solve, but still we do not get any solution. Hence, please check options.


Exactly thats what i was getting 103 in the end to check with the options but none of them satisfied hence i posted this question but i dont know the answer and i donno if the options are wrong or what.. anyways thanks as soon as i get the correct answer i'll post...
mod 11

EN(11) = 10

so 50^56 reduces to 50^6

50^6 mod 11 which is 36*36 *36 mod 11 => 3*3*3 => 27 ...so remainder is 5

x = /4

so possibilities for x to be integer with in

-1000
y = 1,5,9,13,17........

y = /7

x = -1,-8,-15......

when y = 142 x is -993 so
x also take 142 values

so thr vil be 284 values ...


Hi. my first post at pagalguy. Though your solution matches with the answer key, I have a doubt in the solution (and the key)...
If I am not mistaken, the question asks the no. of pairs (x,y) which satisfy the 4x+7y=3. I solved it in the following manner:

y=(3-4x)/7 -----(i)

The general solution of x in (i) is x=7k+6 (k is an integer)
Taking both the above general solution and the constraint xThus for each of the 285 values of x, we have a value of y whose magnitude will definately be less than 1000 since we have a 7 in the denominator of equation (i). So the number of pairs are 285.

If the question says find the number of integers of both x and y, then we should simply double the number of pairs = 285*2 = 570 which is not even an option.

Please let me know where I am going wrong.

Hey puys,

Nice problem for you all......
What will be the remainder when
(2^2+22^2+222^2+2222^2+.....................+22.....(2upto 49 times) )
is divided by 9?

Hey puys,

Nice problem for you all......
What will be the remainder when
(2^2+22^2+222^2+2222^2+.....................+22.....(2upto 49 times) )
is divided by 9?

Q: . 2^2 + 22^2 + 222^2 + ....... + (222.....49 twos)^2 divided by 9

Soln:

3. 2^2 + 22^2 + 222^2 + ....... + (222.....49 twos)^2 divided by 9


This can be written as 4(1 + 11^2 + 111^2......)

if you consider 1, 11, 111, 1111.. upto... 11111111, each one would leave remainders 1, 2, 3,4,5,6,7,8,0 when divided by 9...

this cycle repeats for every 9 terms.

so, square of these terms would leave a remainder of 1^2, 2^2,......
which means 1, 4,0,7,7,0,4,1,0.. (the ninth term is divisible by 9. adding these and dividing it by 9 again we get remainder 6.

so we have this continuing upto 11111....45 terms

we have 46th term rem = 1
47 rem = 4
48 rem = 0
49 rem = 7

adding up we get 12

so we have 6*5 + 12 = 42

42/9 rem = 6

finally multiplying this by original 4( which was taken out as common factor) we have 24

24/9 rem = 6
Ans = 6
Also u can use the EN concept if u are aware of that
Q: . 2^2 + 22^2 + 222^2 + ....... + (222.....49 twos)^2 divided by 9

Soln:

3. 2^2 + 22^2 + 222^2 + ....... + (222.....49 twos)^2 divided by 9


This can be written as 4(1 + 11^2 + 111^2......)

if you consider 1, 11, 111, 1111.. upto... 11111111, each one would leave remainders 1, 2, 3,4,5,6,7,8,0 when divided by 9...

this cycle repeats for every 9 terms.

so, square of these terms would leave a remainder of 1^2, 2^2,......
which means 1, 4,0,7,7,0,4,1,0.. (the ninth term is divisible by 9. adding these and dividing it by 9 again we get remainder 6.

so we have this continuing upto 11111....45 terms

we have 46th term rem = 1
47 rem = 4
48 rem = 0
49 rem = 7

adding up we get 12

so we have 6*5 + 12 = 42

42/9 rem = 6

finally multiplying this by original 4( which was taken out as common factor) we have 24

24/9 rem = 6
Ans = 6
Also u can use the EN concept if u are aware of that

Thanx dude....
I don't know about the EN concept can you explain me how to apply it???
Thanx dude....
I don't know about the EN concept can you explain me how to apply it???



EN concept:

# a^Euler(b) mod b = 1 , if a and b are relatively prime.

Let " N" be a natural number such that N = a^p* b^q* c^r where a,b,c are relatively primes

Euler of number N can be expressed as ...N*(1-1/a)(1-1/b)....

EX: EN(100) = 10^2 = 10*10 => 100*(1-1/10)(1-1/10) => do not write like this

EN(100) = 25*4 = 5^2 * 2^2 => 100*(1-1/5)(1-1/2) => 10*4

=40

also works for LCM ( 4,10 ) = 20

now, any number relatively prime to 100 raised to power 40 leaves remainder 1

Example: 3^20/25 -> remainder 1


since Euler of 25 = 5^2 => 25*(1-1/5) = 20


# Some times v get the power Less thn euler number ( like 3^19 mod 25)

here power is 19 but EN(25) = 20

so here v apply Inverse euler ...

Like... a^euler(b)-1, a^euler(b) -2 and so on..

for this we find the inverse equivalent of a -> c.

c is the least natural number such that a*c mod b = 1

when such c is found,

we can conclude that

a^(euler(b) - k) mod b = c^k mod b.

Example:

3^19 mod 25

=>3^-1 mod 25

=> 17^1 mod 25 => 17 is remainder

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)=?