There are 300 students at a local high school. On "All Students Exercise Day", Sam, the Physical Education instructor, wants them to line up in a perfect rectangular formation (same number of students in each row). However, there must be more than 1 student in each row or column. How many different formations are there?
Details and assumptions
For this question, the students are considered identical.
A formation is different if there are a different number of rows. In particular, the 1 by 300 formation is different from the 300 by 1 formation (though neither are valid).
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The problem is equivalent to finding the number of divisors of 300 (excluding 1 and 300), as each divisor will correspond to one specific rectangular arrangement - for example, the divisor "3" corresponds to a 3 x 100 rectangle, "5" corresponds to a 5 x 60 rectangle, and so on.
The first step is to find the prime factorisation of 300. This can be done by repeatedly dividing by 2, then by 3, then by increasingly larger primes until the result is 1, giving 2 2 3 1 5 2 .
The number of factors of an integer is then given by ( q 1 + 1 ) ( q 2 + 1 ) . . . ( q n + 1 ) , where q n represents the exponents of 2, 3, 5 and so on in the prime factorisation above.
Therefore, 300 has (2+1)(1+1)(2+1)=18 divisors. Remembering to exclude 1 and 300, the solution to the original problem is 16.
300=2^2 3 5^2 Thus, it has 3 2 3=18 different factors Each of the factor 300 has can be the number of rows, and there will be a corresponding number of columns. Apart from 1 300 and 300 1, all other formations work. Thus, there are 18-2=16 formations
we have to count how many positive divisors 3 0 0 has. 3 0 0 can be expresses as 2 2 ⋅ 5 2 ⋅ 3 , which means that 3 0 0 has ( 2 + 1 ) ( 2 + 1 ) ( 1 + 1 ) = 1 8 positive factors. We must not include 1 and 300 from the list, hence there are 1 6 factors all in all.
the divisors of 300 are 2,3,4,5,6,10,15,20,25,30,50,60,75,100,150(total 16)
rectangles may of
2x150 and 150x2 specify(row x column)
3x100 and 100x3
4x75 and 75x4
5x60 and 60x5
6x50 and 50x6
10x30 and 30x10
12x25 and 25x12
15x20 and 20x15
so there are 16 possible way.
function isInt(n) { return typeof n === 'number' && parseFloat(n) == parseInt(n, 10) && !isNaN(n); } // 6 characters
isInt(300);
rowColumnCombo = function(numStudents){ var totalStudents = numStudents; var cases = 0; for(var i=1; i<=numStudents; i++){ var temp = totalStudents/i; if(isInt(temp)){ console.log(i+" rows and "+temp+" columns"); cases++; } } console.log("There are "+cases+" possible cases."); }
rowColumnCombo(300);
Running this script will result in 18 cases. Removing the cases that satisfy the case where there is one student in either row or column, we then have 16 cases.
Any formation with A rows and B columns corresponds to a factorization of 3 0 0 = A × B . From divisors of an integer , we know that 3 0 0 = 2 2 × 3 × 5 2 has ( 2 + 1 ) × ( 1 + 1 ) × ( 2 + 1 ) = 1 8 positive factors. After accounting for the formations of 1 row and 1 column, there will be 1 8 − 2 = 1 6 allowable formations.
Problem Loading...
Note Loading...
Set Loading...
The number of divisors in a number n , which can be factored into p 1 a × p 2 b × p 3 c … , where p 1 , p 2 , p 3 … are primes, and a , b , c . . are non-negative integers, is given by ( a + 1 ) × ( b + 1 ) × ( c + 1 ) … .
Finding the number of ways in which 3 0 0 students can be divided is equivalent to finding the number of divisors of 3 0 0 , since each divisor d has a complement ( d 3 0 0 ) , and is thus capable of forming a pair of sides of the rectangle formed. Now 3 0 0 = 3 1 × 2 2 × 5 2 , so number of divisors of 3 0 0 is ( 1 + 1 ) × ( 2 + 1 ) × ( 2 + 1 ) = 1 8 However, we cannot consider factors 1 and 3 0 0 , due to the restrictions imposed in the question. So the number of divisors, or the number of ways 3 0 0 students can be divided = 1 8 − 2 which is 1 6