...z........................
(a) The multiplicative inverse of 1234 (mod 4321) is x so that 1234*x ≡ 1 (mod 4321). We can apply Euclid's algorithm:
4321 = 1234 * 3 + 619
1234 = 619 * 1 + 615
619 = 615 * 1 + 4
615 = 4 * 153 + 3
4 = 3 * 1 + 1
Now we will express 1 as a linear combination of 4321 and 1234:
1 = 4 - 3
1 = 4 - (615 - 4 * 153) = 4 * 154 - 615
1 = 619 * 154 - 155 * (1234 - 619) = 619 * 309 - 155 * 1234
1 = (4321 - 1234 * 3) * 309 - 155 * 1234 = 4321 * 309 - 1082 * 1234
This reduces to
1 ≡ -1082 * 1234 (mod 4321)
Thus, the inverse is
-1082 ≡ 3239 (mod 4321)
(b) Since both 24140 and 40902 are even, their GCD cannot equal 1, indicating no inverse exists.
X² + 7x - 8 = 0; product = -8 times 1 = -8; sum = 7; {-1, 8}; x² - 1x + 8x - 8 = 0; x(x - 1) + 8(x - 1) = 0; thus, x + 8 = 0 or x - 1 = 0, leading to x = -8.
Part a) When a page is scaled down to 80%, how much enlargement is necessary to bring it back to its original size?
Let
x---------> the percent enlargement
Given the original size is 100%
This means:
x*80%=100%
x=(100%/80%)
x=1.25--------> 1.25=(125/100)=125%
Thus,
The answer to Part a) is
The percent enlargement required is 125%
Part b) Estimate how many successive copies of a page are needed to make the final copy less than 15% of its original size.
Since the photocopy machine reduces sizes to 80% of the original
Therefore:
Copy N 1
0.80*100%=80%
Copy N 2
0.80*80%=64%
Copy N 3
0.80*64%=51.2%
Copy N 4
0.80*51.2%=40.96%
Copy N 5
0.80*40.96%=32.77%
Copy N 6
0.80*32.77%=26.21%
Copy N 7
0.80*26.21%=20.97%
Copy N 8
0.80*20.97%=16.78%
Copy N 9
0.80*16.78%=13.42%-------------> 13.42% < 15%
Therefore,
The answer to Part b) is
The necessary number of copies to achieve this is 9
Response:
The answer is d
Detailed explanation:
If he initially had 150 to spend on 3 pairs of pants and was left with 30 afterward, the equation would be 3x + 30 = 150. If you're interested in figuring out the price per pair, it comes out to $40
