Answer:
formula is y= mx + c (c=y intercept)
1) slope= m= -0.75, y intercept = -2
y= -0.75x - 2
-------------------------------------------------------------------
2)slope=m=0.5, y intercept = 8
y= 0.5x + 8
This is a simple problem based on combinatorics which can be easily tackled by using inclusion-exclusion principle.
We are asked to find number of positive integers less than 1,000,000 that are not divisible by 6 or 4.
let n be the number of positive integers.
∴ 1≤n≤999,999
Let c₁ be the set of numbers divisible by 6 and c₂ be the set of numbers divisible by 4.
Let N(c₁) be the number of elements in set c₁ and N(c₂) be the number of elements in set c₂.
∴N(c₁) =

N(c₂) =

∴N(c₁c₂) =

∴ Number of positive integers that are not divisible by 4 or 6,
N(c₁`c₂`) = 999,999 - (166666+250000) + 41667 = 625000
Therefore, 625000 integers are not divisible by 6 or 4
Answer:
The correct option is B.
Step-by-step explanation:
According to AAS congruence rule, two triangles are congruent if two angles and a non included side are congruent to corresponding angles and side of another triangle.
We need two angles and a non included side, to use AAS postulate.
In option A, two sides and their inclined angle are congruent, therefore these triangles are congruent by SAS postulate and option A is incorrect.
In option B, two angles and a non included side are congruent, therefore these triangles are congruent by AAS postulate and option B is correct.
In option C, two angles and their included side are congruent, therefore these triangles are congruent by ASA postulate and option C is incorrect.
In option D, all sides are congruent, therefore these triangles are congruent by SSS postulate and option D is incorrect.
Answer:
<h2>3) -82.</h2><h2>4)-70.</h2><h2>5) -15.</h2><h2>6)-14.</h2><h2>7)5</h2><h2>8)15</h2><h2>9)16</h2><h2>10 )16</h2><h2>11)64</h2><h2>12)21.</h2><h2>13)1500 in the middle (not above not below)</h2><h2>14)450 m</h2>
Answer:
The horizontal segment of E and vertical segments of M.
Step-by-step explanation: