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.
Answer:
- {0, 11, 22, 33, 44, 55, 66, 77, 88, 99, 110}
Step-by-step explanation:
<u>The relationship is:</u>
y - is the money received for the coupons, x- is the number of coupons
<u>x is the domain and it includes whole numbers from 0 to 11:</u>
- x = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
<u>y is the range and it includes the set of numbers:</u>
- y = {0, 11, 22, 33, 44, 55, 66, 77, 88, 99, 110}
Answer:
9
Step-by-step explanation: