Answer:
All rational numbers or all numbers
Step-by-step explanation:
The function is a linear positive slope equation, which looks like the screenie below. Lines always travel forever, and since it is a linear line with a slope, it will be forever going in both directions.
Domain is the x-values that a function has, while range is the y-values.
Since the domain and range are infinite, it is all real numbers.
Hope this helps!
Edit: forgot the image
I zoomed out 2 million units out so you get what im saying kinda
Answer:
1680 ways
Step-by-step explanation:
Total number of integers = 10
Number of integers to be selected = 6
Second smallest integer must be 3. This means the smallest integer can be either 1 or 2. So, there are 2 ways to select the smallest integer and only 1 way to select the second smallest integer.
<u>2 ways</u> <u>1 way</u> <u> </u> <u> </u> <u> </u> <u> </u>
Each of the line represent the digit in the integer.
After selecting the two digits, we have 4 places which can be filled by 7 integers. Number of ways to select 4 digits from 7 will be 7P4 = 840
Therefore, the total number of ways to form 6 distinct integers according to the given criteria will be = 1 x 2 x 840 = 1680 ways
Therefore, there are 1680 ways to pick six distinct integers.
Answer:
There are 10 counters in the bag and you want the 4
As their is only one for the probability is
1/10
There are now 9 counters left in the bag.
You only want the even ones , which are 2 6 8 and 10 ( four has been taken out)
There are only four even counters in the bag of nine counters so the probability is
4/9
As you want both of these to occur, you need to multiply them
1/10 x 4/9 = 49/90
Step-by-step explanation:
Maybe you should contact your teacher
9514 1404 393
Answer:
(a) 6² +3² +1² +1² = 47
(b) 5² +4² +2² +1² +1² = 47
(c) 3³ +4² +2² = 47
Step-by-step explanation:
It can work reasonably well to start with the largest square less than the target number, repeating that approach for the remaining differences. When more squares than necessary are asked for, then the first square chosen may need to be the square of a number 1 less than the largest possible.
The approach where a cube is required can work the same way.
(a) floor(√47) = 6; floor(√(47 -6^2)) = 3; floor(√(47 -45)) = 1; floor(√(47-46)) = 1
__
(b) floor(√47 -1) = 5; floor(√(47-25)) = 4; ...
__
(c) floor(∛47) = 3; floor(√(47 -27)) = 4; floor(√(47 -43)) = 2
