Answer:
The smallest positive integer solution to the given system of congruences is 30.
Step-by-step explanation:
The given system of congruences is
![x=0(mod5)](https://tex.z-dn.net/?f=x%3D0%28mod5%29)
![x=8(mod11)](https://tex.z-dn.net/?f=x%3D8%28mod11%29)
where, m and n are positive integers.
It means, if the number divided by 5, then remainder is 0 and if the same number is divided by 11, then the remainder is 8. It can be defined as
![x=5m](https://tex.z-dn.net/?f=x%3D5m)
![x=11n+8](https://tex.z-dn.net/?f=x%3D11n%2B8)
![5m\cong 11n+8](https://tex.z-dn.net/?f=5m%5Ccong%2011n%2B8)
Now, we can say that m>n because m and n are positive integers.
For n=1,
![5m=11(1)+8=19](https://tex.z-dn.net/?f=5m%3D11%281%29%2B8%3D19)
![5m=19](https://tex.z-dn.net/?f=5m%3D19)
19 is not divisible by 5 so m is not an integer for n=1.
For n=2,
![5m=11(2)+8](https://tex.z-dn.net/?f=5m%3D11%282%29%2B8)
![5m=30](https://tex.z-dn.net/?f=5m%3D30)
![m=6](https://tex.z-dn.net/?f=m%3D6)
The value of m is 6 and the value of n is 2. So the smallest positive integer solution to the given system of congruences is
![x=5(6)=30](https://tex.z-dn.net/?f=x%3D5%286%29%3D30)
Therefore the smallest positive integer solution to the given system of congruences is 30.
Step-by-step explanation:
One's digit of N can be 2 or 7.
1/6+3/8=13/24 (13/24 is the simplest form in this case)
Answer:
1 Year & 14.99%
Step-by-step explanation:
Answer:
10 is the base number, and 5 is the exponent
Step-by-step explanation: