Three hundred thirty six students of school A and four hundred thirty two students of school B were to participate in a parade. For this, they had to stand in rows in such a way that no students of school A and B would get mixed up and the number of students in each row would be the same.

What will be the maximum number of students standing in a row?

assuming that "no students of school A and B would get mixed up" means that each row contains only students from one school, let's find the largest number that divides both 336 and 432.

GCF(336,432) = 48

So, school A has 7 rows of 48
and school B has 9 rows of 48

To find the maximum number of students standing in a row, we need to find the greatest common divisor (GCD) of the two numbers: 336 and 432.

Here's how to find the GCD using the Euclidean algorithm:

1. Divide the larger number (432) by the smaller number (336): 432 ÷ 336 = 1 remainder 96.

2. Now, divide the smaller number (336) by the remainder (96): 336 ÷ 96 = 3 remainder 48.

3. Continue dividing the previous remainder (96) by the new remainder (48): 96 ÷ 48 = 2 remainder 0.

4. The GCD is the last non-zero remainder, which is 48.

Therefore, the maximum number of students standing in a row would be 48.