The Gateway to Computer Science Excellence
0 votes
21 views

Let $k$ and $n$ be integers greater than $1$. Then $(kn)!$ is not necessarily divisible by

  1. $(n!)^k$
  2. $(k!)^n$
  3. $n! \cdot k! \cdot$
  4. $2^{kn}$
in Numerical Ability by Veteran (431k points)
recategorized by | 21 views

1 Answer

0 votes
$D$

Let $k=n=2$

Now,
$(kn)! = (2*2)! = 4! = 24$
which is not divisible by $2^{kn} = 2^4 = 16 $

Hence, option $D$ is the right answer.
by Boss (19.1k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,374 answers
198,513 comments
105,288 users