Answer:
the answer is __________________ fill the blanks have fun EX
Step-by-step explanation:
Answer:
Step-by-step explanation:
550 48 6-0 3/16 3/16 800
1000 48 10-10 3/16 3/16 1300
1100 48 11-11 3/16 3/16 1400
1500 48 15-8 3/16 3/16 1650
65 9-0 3/16 3/16 1500
2000 65 11-10 3/16 3/16 2050
2500 65 14-10 3/16 3/16 2275
3000 65 17-8 3/16 3/16 2940
4000 65 23-8 3/16 3/16 3600
5000 72 23-8 1/4 1/4 5800
84 17-8 1/4 1/4 5400
7500 84 26-6 1/4 1/4 7150
96 19-8 1/4 1/4 6400
10000 96 26-6 1/4 5/16 8540
120 17-0 1/4 5/16 8100
12000 96 31-6 1/4 5/16 10500
120 20-8 1/4 5/16 9500
15000 108 31-6 5/16 5/16 13300
120 25-6 5/16 5/16 12150
20000 120 34-6 5/16 5/16 15500
25000 120 42-6 3/8 3/8 22300
30000 120 51-3 3/8 3/8 28000
Answer:
a . domain 5,0,7,9,0
range -2,-2,-4,8,2
b. domain 2,4,8,9
range 1,2,4,11
Step-by-step explanation:
<h3>a is not a function</h3>
because function is a relationship in which each domain element occurs only once.
<h3>b is a function</h3>
The sum of the first n odd numbers is n squared! So, the short answer is that the sum of the first 70 odd numbers is 70 squared, i.e. 4900.
Allow me to prove the result: odd numbers come in the form 2n-1, because 2n is always even, and the number immediately before an even number is always odd.
So, if we sum the first N odd numbers, we have
The first sum is the sum of all integers from 1 to N, which is N(N+1)/2. We want twice this sum, so we have
The second sum is simply the sum of N ones:
So, the final result is
which ends the proof.