Answer:1
Step-by-step explanation: The problem states that each row has only one kind of trophy so the only answer i could think of is one
Answer:
58%
Step-by-step explanation:
This is because you need to set up the equation _ % of _ is _ and then plug in numbers. _% of 377 is 217 is the final equation. Then divide 217 by 377 which is 0.57559681697. Then you round to the nearest hundredth to get 58%
Answer:
Bet
Step-by-step explanation:
It’s a simple one to write. There are many trios of integers (x,y,z) that satisfy x²+y²=z². These are known as the Pythagorean Triples, like (3,4,5) and (5,12,13). Now, do any trios (x,y,z) satisfy x³+y³=z³? The answer is no, and that’s Fermat’s Last Theorem.
On the surface, it seems easy. Can you think of the integers for x, y, and z so that x³+y³+z³=8? Sure. One answer is x = 1, y = -1, and z = 2. But what about the integers for x, y, and z so that x³+y³+z³=42?
That turned out to be much harder—as in, no one was able to solve for those integers for 65 years until a supercomputer finally came up with the solution to 42. (For the record: x = -80538738812075974, y = 80435758145817515, and z = 12602123297335631. Obviously.)
9514 1404 393
Answer:
15
Step-by-step explanation:
In vector form, the equation of point p on the line can be written as ...
p = (-3, -4) +t(25 -(-3), 38 -(-4)) . . . . . for some scalar t
p = (-3, -4) +t(28, 42)
p = (-3, -4) +14t(2, 3)
where t takes on any value between 0 and 1.
If we let t = n/14 for some integer 0 ≤ n ≤ 14, then the coordinates of point p will be integers.
There are 15 values that n can have in the allowed range.
The caterpillar touches 15 points with integer coordinates.
Answer:
1.
Step-by-step explanation:
The > symbol shows that you have to be older than 13, and there must be a line underneath to signify a can be equal to the number (meaning you can be 13 to do this).
