Solution:

Edward is Bella's date.

As no two of them have the same number of preferred traits - from (1), exactly one of them has none of the preferred traits and exactly one of them has all the preferred traits.

From (4) and (5), there are only two possibilities:
* Lautner & Edward both are tall and Jacob & Welch both are fair.
* Lautner & Edward both are short and Jacob & Welch both are dark.

But from (2), second possibility is impossible. So the first one is the correct possibility i.e. Lautner & Edward both are tall and Jacob & Welch both are fair.

Then from (3), Jacob is short and handsome.

Also, from (1) and (2), Lautner is tall and fair. Also, Welch is the person without any preferred traits. Edward is Dark. Lautner and Edward are handsome. Thus, following are the individual preferred traits:

Edward - Tall, Dark and Handsome
Lautner - Tall and Handsome
Jacob - Handsome
Welch - None :-(

Hence, Edward is Bella's date.

Solution:

457730 * 4 = 1830920
(DOLLAR * 4 = QUARTER)

Solution:

   9567
+ 1085
======
 10652

Solution:

If you see the picture, they formed a pentagonal shape and achieved the required.

Solution:

1/36

Explanation:
The number of possibilities for the first as well as the second dice are 6 and 6 respectively. Therefore the total possibilities or outcome are 6 * 6 = 36.
Out of 36 outcomes, we need only one case i.e. the first gives 2 and the second gives 5.
Therefore, the probability will be 1 on 36 or 1/36.

Solution:

A) Yes

Explanation"
There are two scenarios.

Scenario-1: Millie is married
Millie is looking at Stones(not married)

Scenario-2: Millie is not married
Terry(married) is looking at Millie

Solution:

Step one: First you will have to make 3 trips of 1,000 apples 333 miles. Then you will be left with 2,001 apples and 667 miles to go.

Step two: Next you will have to take 2 trips of 1,000 apples 500 miles. In this manner you will be left with 1,000 apples and 167 miles to go (you have to leave an apple behind).

Step three: At last, you will have to travel the last 167 miles with one load of 1,000 apples and you will be left with 833 apples when you reach the town

Solution:

Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16… leaving it open at the end. So only perfect square doors will remain open at the end.

Solution:

3/7

Explanation:
If a 31day month starts on a Friday, Saturday or Sunday it will have five Sunday, if not it will have 4 Sunday.

Solution:

13 + 11 + 6 = 30

Explanation
The trick is that you just need to rotate '9' to form '6'.

Solution:

The women is a of short stature. She can't reach the upper elevator buttons, but can push is with his umbrella.