Let us have \(2014!\) balls. Let us divide them in \(2012!\) groups, each group having \(2013.2014\) balls.

Let's assume that balls of each group are of different colour, but all balls of the same group are the of the same colour.

Number of ways of doing so is, \[\dfrac{(2014!)!}{((2014.2013)!)^{2012!}}\]
Number of ways of doing something is always a positive integer. Hence Proved. \(\boxed{.}\)

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestLet us have \(2014!\) balls. Let us divide them in \(2012!\) groups, each group having \(2013.2014\) balls.

Let's assume that balls of each group are of different colour, but all balls of the same group are the of the same colour.

Number of ways of doing so is, \[\dfrac{(2014!)!}{((2014.2013)!)^{2012!}}\] Number of ways of doing something is always a positive integer. Hence Proved. \(\boxed{.}\)

Log in to reply

Using Combinatorics for a Number Theory Problem is simply amazing!

Log in to reply

Excellent! +1

Log in to reply

@Satvik Golechha this is great method see solution of @John Ashley Capellan here

Log in to reply

superb way to do this......

Log in to reply