MHB Optimizing n for Integer Solutions in Factorial Expressions

  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Value
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Find the smallest value of $n$ for which $\dfrac{n!\cdot n!}{(n+6)!}$ is an integer.
 
Mathematics news on Phys.org
anemone said:
Find the smallest value of $n$ for which $\dfrac{n!\cdot n!}{(n+6)!}$ is an integer.

89

we need (n+1) to (n+6) all should be composite so product should be a factor of n!. then check that it is factor smallest 6 composite consecutive numbers start at 90

90 = 9 * 10
91 = 13 * 7
92 = 23 * 4
93 = 3 * 31
94 = 2 * 47
95 = 5 * 19

take the product and we have 10 different numbers < 90 on the right and product divided 89!
 
kaliprasad said:
89

we need (n+1) to (n+6) all should be composite so product should be a factor of n!. then check that it is factor smallest 6 composite consecutive numbers start at 90

90 = 9 * 10
91 = 13 * 7
92 = 23 * 4
93 = 3 * 31
94 = 2 * 47
95 = 5 * 19

take the product and we have 10 different numbers < 90 on the right and product divided 89!

Well done, kaliprasad!:cool:
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top