Aptitude and Reasoning Questions

The possible outcomes that satisfy the condition of "at least one house gets the wrong package" are:
One house gets the wrong package or two houses get the wrong package or three houses get the wrong package.

We can calculate each of these cases and then add them together, or approach this problem from a different angle.
The only case which is left out of the condition is the case where no wrong packages are delivered.

If we determine the total number of ways the three packages can be delivered and then subtract the one case from it, the remainder will be the three cases above.

There is only one way for no wrong packages delivered to occur. This is the same as everyone gets the right package.

The first person must get the correct package and the second person must get the correct package and the third person must get the correct package.
 1×1×1=1

Determine the total number of ways the three packages can be delivered.
 3×2×1=6

The number of ways at least one house gets the wrong package is:
  6−1=5
Therefore there are 5 ways for at least one house to get the wrong package.

Let A be event of selecting a number divisible by 3. B be the event of selecting a number divisible by 7.

  

 A = { 3, 6, 9, 12, 15, 18, 21, 24, 27, 30 }, so n(A)=10
 B = { 7, 14, 21, 28 }, n(B)= 4 

 

Since A and B are not mutually exclusive So :

10C5*28C1*10C6 = 7266

12 year old Manish is three times as old as his brother Rajeev who must be 4 years old.
Diff in ages = 8 years.
when Rajeev will become 8 years old, Manish will be 16 yrs old and he will be twice as old as Rajeev.

If a card hand that consists of four Queens and an Ace is rearranged, nothing has changed.

The hand still contains four Queens and an Ace. Thus, use the combination formula for problems with cards.

We have 4 eights and 4 sevens.

We want 3 eights and 2 sevens.

C(have 4 eights, want 3 eights) x C(have 4 sevens, want 2 sevens) 

C(4,3) x C(4,2) = 24

Therefore there are 24 different ways in which to deal the desired hand.

kl>k+1l+1 for (k,l) > 0 and  k > l 

Let     k = x+1    and   l = x

Therefore, x+1x>(x+1)+1(x)+1

 (x + 1) > x

Therefore, log(x+1)log(x)>log(x+2)log(x+1)

⇒logxx+1 >logx+1x+2