If x ≡ w mod 357 then:
x = 357k + w for some integer k.
Now 357 = 21×17, and w = 17n + c for some integers n ≥ 0 and 0 ≤ c < 17
→ w ≡ c mod 17
This gives:
x = 21×17×k + 17n + c
→ x = 17(21k + n) + c
→ x = 17m + c where m = 21k + n (is an integer)
→ x ≡ c mod 17
→ the remainder when the number is divided by 17 is the same as the remainder when the original remainder w is divided by 17.
To determine how many times 4 can go into 357, you would perform long division. The quotient is the result of dividing the dividend (357) by the divisor (4). In this case, 4 can go into 357 approximately 89 times, with a remainder of 1.
365
It is: 357/8 = 44 with a remainder of 5
0
It is 300 + 50 + 7.
To determine how many times 4 can go into 357, you would perform long division. The quotient is the result of dividing the dividend (357) by the divisor (4). In this case, 4 can go into 357 approximately 89 times, with a remainder of 1.
357 divided by 7 is 51 with remainder 0
51
If x ≡ 39 mod 357 then: x = 357k + 39 for some integer k. Now 357 = 21×17, and 39 = 2×17+5 → x = 21×17×k + 2×17 + 5 → x = 17(21k + 2) + 5 → x = 17m + 5 where m = 21k + 2 (is an integer) → x ≡ 5 mod 17 → the remainder when the number is divided by 17 is 5.
365
It is: 357/8 = 44 with a remainder of 5
It goes: 357/8 = 44 times with a remainder of 5
89 with remainder 1.
51
no, the gcf of 357 & 102 is not 3; it is 51. Here's how: divide 357 by 102; remainder is 51 next, divide 102 by 51; rem is 0. End of process. then the gcf is the last nonzero remainder in the above process - which in this example is 51.
4% of 357 = 4% * 357 = 0.04 * 357 = 14.28
The question isn't clear. "Five number 357 prime number" doesn't make sense.