You're playing a game where you defend your village from an orc invasion. There are 333 characters (elf, hobbit, or human) and 5
1 answer:
You might be interested in
Answer: Choice C (empty set)
The first thing to do is subtract 7 from both sides
|x| + 7 < 4
|x| + 7 - 7 < 4 - 7
|x| < -3
Recall that absolute value represents distance on a number line. Saying |x| is less than -3 means the distance is smaller than -3, which is impossible. Anything smaller than -3 is also negative. Distance can never be negative.
That leads us to the empty set as the solution. There are no values we can plug into any of the inequalities above, to have them lead to true statements.
Writing the special symbol is one way to represent the empty set. Another way is to write curly braces only with nothing inside them like so: { }, so its a set with nothing inside it more or less.
Answer:
The least possible number of coins the Pirate has = 81
Step-by-step explanation:
Given:
Pirate Jack has equal number of gold and silver coins.
When the pirate splits the coins into 7 equal piles he has 4 coins left.
When the pirate splits the coins into 11 equal piles he has 4 coins left.
Every pile has at least 1 coin.
To find the least possible number of coins Pirate Jack has.
Solution:
In order to find the least possible number of coins pirate Jack has, we must find the least common multiple of the number of piles the coins are split into.
So, the least common multiple of 7 and 11 can be found by listing the multiples.
So, we find the least common multiple of 7 and 11 is 77.
Number of coins left = 4
Total number of coins the pirate must have =
We can check the answer by dividing 81 by 7 and 11. I both cases we get remainder = 4.
So, the least possible number of coins the pirate has = 81