Putting the information in a table makes it easier to solve. We’ll use A for Angie, B for Brenda, T for truth and F (false) for lying.
S
M
T
W
Th
F
S
A
T
F
F
F
T
T
T
B
T
T
T
T
F
F
F
To begin with, there aren’t any days where both of them told the truth and lied the day before, so we know one of them must be lying.
So we have two options, either Angel is lying or Brenda is.
Option 1. Angel is lying.
In order for this to be the case, she needs to be lying today and telling the truth yesterday, so we need two days in a row with T F. And if Brenda is telling the truth, she would need two days with F T. That means we’re looking for two days that have
Angie: T F
Brenda: F T
Option 2. Brenda is lying.
This is just the reverse of the above, so we need to find:
Angie: F T
Brenda: T F
The only day that matches either of the two options is Thursday, and it’s option 2. Brenda is the liar.
The most impressive boundary’s not a wall. It’s not a manufactured thing at all. Moving towards it won’t reduce the gap and nothing marks its presence on a map.
Half-way up the hill, I see thee at last, lying beneath me with thy sounds and sights — A city in the twilight, dim and vast, with smoking roofs, soft bells, and gleaming lights.
A similar problem can be found in L.A. Graham’s Ingenious Mathematical Problems and Methods with a range of 1 to 9, but the principle remains the same – the numbers with the smallest difference produce the largest product. You start out with the highest two digits, 7 and 6, then attach 5 and 4, putting the smaller of the two digits with the larger number, giving you 74 and 65. The next two highest digits are 3 and 2, giving you 742 and 653. Finally, you add the 1 to the lower number. Page 80 has the details of that solution.
Everly and I were playing on the merry-go-round at the local park. It was very large and we stood on opposite sides. As we spun the merry-go-round counter-clockwise, I threw a ball to Everly. Did the ball go to Everly, to the right or left of them?