Answer:
The minimum number of letters John has to send to be sure that Peter receives his letter is 127 letters
Step-by-step explanation:
The four digit numbers that are multiples of 5 and 7 with the last digit = 0 is found as follows
Since the last digit of the house number = 10, then the house number is divisible by 10 which also meets the condition that the house number is divisible by 5
We have the four digit numbers from 1000 to 9999
Hence the numbers divisible by both 7 and 10 are from (1000/70 (Which is 14 + 2/7) - 2/7)×70 + 70 = 1050 to (9999/70 (Which is 142 + 59/70)- 59/70)×70= 9940
Which gives 142 - 15 = 127 numbers which are four digit number multiples of 5 and 7 with the last digit = 0
Hence the minimum number of letters John has to send to be sure that Peter receives his letter = 127 letters.
To solve this problem you must apply a theorem called: Intersecting secant theorem. The proccedure is shown below:
1) For the figure shown on the left:
(5)(x+5)=(6)(4+6)
5x+25=60
5x=60-25
x=35/5
x=7
2) For the figure shown on the right:
(3)(3+5)=(4)(x+4)
24=4x+16
24-16=4x
8=4x
8/4=x
x=2
<span>A. Let w= the weight of one brick.</span>
Answer:
-9m and 3m
and
3 and - 8
Step-by-step explanation:
In algebra, like terms are terms that have the same variables and powers. The coefficients do not need to match. Unlike terms are two or more terms that are not like terms, i.e. they do not have the same variables or powers.
