The explanation for this is one of my favorite pieces of mathematical reasoning. First, let's thing about distance; what's the shortest distance between two points? <em>A straight line</em>. If we just drew a straight line between A and B, though, we'd be missing a crucial element of the original problem: we also need to pass through a point on the line (the "river"). Here's where the mathemagic comes in.
If we take the point B and <em>reflect it over the line</em>, creating the point B' (see picture 1), we can draw a line straight from A to B' that passes through a point on the line. Notice the symmetry here; the distance from the intersection point to B' is<em> the same as its distance to B</em>. So, if we reflect that segment back up, we'll have a path to B, and because it came from of the line segment AB', we know that it's <em>the shortest possible distance that includes a point on the line</em>.
If we apply this same process to our picture, we see that the line segment AB' crosses the line at the point (1, 1)
Answer: The graph is shifted 6 units to the right.
Step-by-step explanation:
It is important to remember that:
When , then the function is shifted "k" units to the right.
Knowing this and given the quadratic parent function and the function
, you can observe that one of the transformations is the following:
Where:
Therefore, you can notice that the effect is:
The graph is shifted 6 units to the right.
Answer:
360
Step-by-step explanation:
The given digits are 1,2,3,4,5,6.
So, total number of digits = 6.
We need to find the number of different ways to form four-digit numbers using the digits, without repetition.
Total ways for first place = 6
After selecting 1 digit the number of remaining digits is 5. So,
Total ways for second place = 5
Similarly,
Total ways for third place = 4
Total ways for forth place = 3
Total number of ways =
Therefore, 360 four digit numbers are possible.