160/30 is a division problem. 5 1/3
Using Euclid's algorithm, it's the same as the gcf of 105 and 55 (where 55 is the remainder of the division of 160 by 105).
It is: 100/160 times 96 = 60 and 160% of 60 = 96
8% of 160 = 12.8therefore, duduct 12.8 from 160 to find the answerwhich is 147.2
There is no way to find B 160 50 and 120 without knowing what these numbers correspond with. Once we know what the numbers correspond with then we can find the answer.
160/30 is a division problem. 5 1/3
Using Euclid's algorithm, it's the same as the gcf of 105 and 55 (where 55 is the remainder of the division of 160 by 105).
The highest common factor (HCF) of 160 and 200 is the largest positive integer that divides both 160 and 200 without leaving a remainder. To find the HCF, you can use the prime factorization method. The prime factorization of 160 is 2^5 * 5, and the prime factorization of 200 is 2^3 * 5^2. To find the HCF, you take the common factors with the lowest exponent, which in this case is 2^3 * 5 = 40. Therefore, the HCF of 160 and 200 is 40.
It is: 100/160 times 96 = 60 and 160% of 60 = 96
8% of 160 = 12.8therefore, duduct 12.8 from 160 to find the answerwhich is 147.2
Easiest way I did this was find 20% of 160 and minus it from 100% of 160. Eg. 100% of 160 = 160 , 20% of 160 = 32, 160-32=128 = 80% of 160 put this in a calculator : (128/160)x100 should equal 80
The number of times 2 can go into 160 is determined by dividing 160 by 2. The division yields a quotient of 80, indicating that 2 can go into 160 a total of 80 times without a remainder. This is because 80 multiplied by 2 equals 160.
160∘
One fifth of 160 is 32.
There is no way to find B 160 50 and 120 without knowing what these numbers correspond with. Once we know what the numbers correspond with then we can find the answer.
160 80,2 40,2,2 20,2,2,2 10,2,2,2,2 5,2,2,2,2,2
45/3 = 15/3 = 5/5 = 160/2 = 30/2 = 15/3 = 5/5 = 13 x 3 x 5 = 452 x 2 x 3 x 5 = 60Select the common factors.3 x 5 = 15, the GCF