Factorial Product Is Square

Find the largest integer n 200 n \leq 200 such that for some positive integer k < n k< n the product n ! k ! n!k! is a perfect square.

Details and assumptions

The number n ! n! , read as n factorial , is equal to the product of all positive integers less than or equal to n n . For example, 7 ! = 7 × 6 × 5 × 4 × 3 × 2 × 1 7! = 7 \times 6 \times 5 \times 4 \times 3 \times 2 \times 1 .

If you think that no such n n exists, type your answer as 0.


The answer is 196.

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.

18 solutions

Felipe Sousa
Nov 24, 2013

If n = k + x n=k+x we can write n ! n! as ( k + x ) ( k + x 1 ) . . . ( k + 1 ) k ! (k+x)(k+x-1)...(k+1)k! then n ! k ! = ( k + x ) ( k + x 1 ) . . . ( k + 1 ) ( k ! ) 2 n!k!=(k+x)(k+x-1)...(k+1)(k!)^2 .

So ( k + x ) ( k + x 1 ) . . . ( k + 1 ) (k+x)(k+x-1)...(k+1) is a perfect square if and olny if n ! k ! n!k! is a perfect square too.

In particular if n n is a perfect square n ! ( n 1 ) ! n!(n-1)! is a perfect square too.

We want n < = 200 n<=200 . We check that 196 196 is the largest perfect square before 201 201 so it works.

Now we just need to check if there is any number greater than 196 196 that works.

197 197 and 199 199 are primes so they don't work because n ! k ! n!k! just have the prime factor ( 197 197 or 199 199 ) once since k < n k<n

200 200 and 198 198 don't work because they have the prime factors 199 199 and 197 197 so we need 200 ! 199 ! 200!199! or 198 ! 197 ! 198!197! to have the prime factor twice but they don't work since 200 200 and 198 198 are perfect squares.

So 196 196 it's the answer.

just a typo before the last line is 200 and 198 AREN'T perfect squares.

Felipe Sousa - 7 years, 6 months ago

Why not we try considering k = (n-1). So that in n!k! , we get the value (k!)^2 * n. Thus we can find n which shall be the largest perfect square less than 200. That is, 196

Kshitij Khandelwal - 7 years, 6 months ago

Log in to reply

But to do this you need to prove that n!k! is a perfect square if and only if k=n-1. I didn't prove so i didn't use it (and i still don't know if it's true).

Felipe Sousa - 7 years, 6 months ago

A LaTeX \LaTeX suggestion:

\le

gives \le

William Cui - 7 years, 6 months ago

you wrote a little wrong, 200 and 198 are not perfect square

diltang tong - 7 years, 6 months ago

Why can't we choose n=3 and k=4? Because (3!)(4!)= 144, which is a perfect square.

Jean Paul Filpo - 7 years, 6 months ago

Log in to reply

we cant choose n=3 and k=4 because we are to find the largest integer till 200.

Shubham Thakkar - 7 years, 6 months ago
Priyansh Sangule
Nov 25, 2013

According to the problem ,

We want n ! k ! n!k! as a perfect square , where k < n k < n

Since we have the freedom of choosing the " k k " ,

We can set k = ( n 1 ) k = (n-1) .

Well , you'll say - "Why do we do this ?"

Okay . Observe that

n ! = n ( n 1 ) ! n! = n \cdot (n-1)!

Now, we'll have :

n ! k ! = [ n ( n 1 ) ! ] × ( n 1 ) ! n! \cdot k! = \left[ n \cdot (n-1)! \right] \times (n-1)!

And so ,

n ! k ! = n × [ ( n 1 ) ! ] 2 n! \cdot k! = n \times \left[ (n-1)! \right]^2

Therefore , by setting k = ( n 1 ) k = (n-1) , we get the following conditions -

For n ! k ! n!k! being a perfect square ,

n n must be a perfect square too !

Therefore , we need to find the largest value for n 200 n \leq 200 where n n is a perfect square .

Hence we get

1 4 2 < 200 < 1 5 2 14^2 < 200 < 15^2

Therefore ,

n = 1 4 2 = 196 n = 14^2 = \boxed{196}

Cheers !

Lengthy , but I tried to explain as much as I could :D

Priyansh Sangule - 7 years, 6 months ago

man great job!! and totally love this question! :D

Ajmal Siddiqui - 7 years, 6 months ago

Log in to reply

Thank you !

Priyansh Sangule - 7 years, 5 months ago

good solution :)

Rishabh Jain - 7 years, 6 months ago

i like this solution

Razik Ridzuan - 7 years, 6 months ago

Log in to reply

Thank you

Priyansh Sangule - 7 years, 5 months ago

awesome really....................!!!!!!!!!!!

Manoj Manu - 7 years, 6 months ago

Log in to reply

Thank you

Priyansh Sangule - 7 years, 5 months ago

Good, but you didn't mention why n = 197 , 198 , 199 , 200 n = 197, 198, 199, 200 can't work.

Michael Tang - 7 years, 6 months ago

Log in to reply

I mentioned it in the last lines :D .

Priyansh Sangule - 7 years, 5 months ago

nice question

math man - 6 years, 8 months ago
Ruan Nascimento
Dec 20, 2013

When we have n ! × k ! {n!} \times {k!} , then n ! × k ! = n × ( n 1 ) × ( n 2 ) × × k ! 2 {n!} \times {k!} = n \times {(n-1)} \times {(n-2)} \times \ldots \times {k!^2} . So, if we want perfect squares, n ! k ! \frac {n!}{k!} need to be a perfect square too. The greatest integer which is smaller than 200 is 196 = 1 4 2 196 = 14^2 . Then, the answer is 196.

I'm sorry if my explanations wasn't good or my english was incomprehesible.

n = 196, k = 195 satisfies condition.

We also need to prove that for n = 200, 199, 198, 197 no k exists.

Piyushkumar Palan - 7 years, 5 months ago
Anis Abboud
Nov 24, 2013

196 = 1 4 2 196 ! 195 ! = ( 14 195 ! ) 2 196 = 14^2 \Rightarrow 196!195! = (14 \cdot 195!)^2 .

敬全 钟
Nov 25, 2013

From the question, since k < n k<n , so to make our life easier, let k = n 1 k=n-1 . Since n ! ( n 1 ) ! = n ( ( n 1 ) ! ) 2 n!(n-1)! = n((n-1)!)^{2} , so n n must be a perfect square. This implies to n = 196 n=\boxed {196} , since 196 196 is the biggest perfect square number which is smaller to 200 200 .

Rutvik Paikine
Nov 25, 2013

'n' is equal to or less than 200 ..........................Given.

n! is equal to (n)(n minus 1)(n minus 2)... and so on.

'k' is less than n .......................................................Given.

n!k! is a perfect square ..........................................Given.

So if 'n' is a perfect square and 'k' is one less than 'n' then the condition could be satisfied. But 'n' is less than or equal to 200. Hence largest square uptill 200 is equal to 'n'.

And hence 196 is the answer!!!

For the product of factorials to be a square, they each have the same numbers. There fore n! x (n-1)! will be a perfect square, ie., (n-1)! However, for the entire product to be a perfect square, 'n' should also be a perfect square. The largest square under 200 in 14^2 i.e 196. So technically, the complete solution would be n=196 and k=195

Edo Jayakusuma
Nov 24, 2013

1.Firstly just look at the last integers (or n) because the integers before it are perfect square if you optimize the k 2. Then look at the biggest possible square from 0 to 200. Then voila I've found 14.

Jordhy Fernando
Nov 28, 2013

The product of n!k! is a perfect square. That means that n must be a perfect square so that n!k! is a perfect square. The largest integer n is 196 .

Andrew Huang
Nov 27, 2013

For n!k! to be a perfect square, n has to be one more than k and n has to be a perfect square. That way, all the numbers that are contained in k! are squared and n is left and is also a perfect square, thus the number is a perfect square since all its factors are repeated at twice. The largest square under 200 is 196, which is the answer.

Divakaran Karan
Nov 26, 2013

largest square less than 200 is 196=14 * 14 .....................thus 199 * 198fact * 198fact is a square

Abin Das
Nov 25, 2013

n!=1 2 3*..n

k!=1 2 3*..k

where k<n.

If k=n,n!k! is a perfect square.

But since k<n,n!/k! is a perfect square.The largest perfect square less than or equal to 200 is 196.

Therefore n!/k!=196 where n=196,k=195.

n!= 1 × 2 1\times2 × 3 \times3 .. × \times n

k!= 1 × 2 1\times2 × 3 \times3 .. × \times k

Abin Das - 7 years, 6 months ago
Satyaki Dutta
Nov 25, 2013

n!k! is always a square number when n is a square and k=n-1 Therefore n!=n.(n-1)! or n!=n.k! Thus n!.k!= n.(k!)^2 Thus its a square when n is a square. The greatest square number below 200 is 196.

Rutvik Paikine
Nov 25, 2013

'n' is equal to or less than 200 ..........................Given.

n! is equal to (n)(n minus 1)(n minus 2)... and so on.

'k' is less than n .......................................................Given.

n!k! is a perfect square ..........................................Given.

So if 'n' is a perfect square and 'k' is one less than 'n' then the condition could be satisfied. But 'n' is less than or equal to 200. Hence largest square uptill 200 is equal to 'n'.

And hence 196 is the answer!!!

Ojas Jain
Nov 25, 2013

n!=n [n-1]! WE WANT THE GREATEST n, SO LET US ASSUME THAT k=[n-1] THEREFORE,n!k!=n[n-1]! [n-1]! =n[n-1]!^2 IF,WE WANT n!k! AS PERFECT SQUARE,THEN n SHOULD BE A PERFECT SQUARE BECAUSE [n-1]! IS ALREADY A SQUARE. THEREFORE LARGEST n<200 WILL BE 196

Apoorva Pasbola
Nov 24, 2013

n!=1x2x3x4...(n-1)xn. k!=1x2x3x4....(k-1) xk. Since k<n,therefore largest possible value of k will be n-1. k!n!=1^2 x 2^2 x 3^2 x 4^2....(n-1)^2 x n To make it a perfect square 'n' should be a square and largest value of n<200 which is a square is 196.

let k = n - 1 Now n!k! = n x k! x k! k! x k! is always a perfect square. So, we require n such that "n" is a perfect square. Largest such value is 196.

Lee YongKyu
Nov 24, 2013

n must be perfect square if n!k! is perfect square. If k takes n-1, n!k! = n x (n-1)^2, so n must be perfect square, and the largest n is 196

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...