Today, I , Svatejas and Vighnesh were chatting on slack and I accidentally came across this problem:

Find the largest integer \(n\) such that \(n!<a\) for some positive integer \(a\) having \(n\) digits.

Find a method to do this. Hoping for numerous approaches :)

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

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:

TopNewestHere is an interesting result: \(\lceil \log([\log(2^{10000})]!) \rceil = 9166\)

Log in to reply

That was indeed surprising LOL

Log in to reply

@Nihar Mahajan Let's create some problem using factorials and 9166 tomorrow. Till then I won't follow anyone :P

Log in to reply

Sure!

Log in to reply

@Pi Han Goh @Ivan Koswara @Sharky Kesa @Brian Charlesworth

Log in to reply

There is no one-formula for this question.

Log in to reply

If we include some relation between \(a\) and \(n\) then? For example: if \(a\) has \(n\) digits.

Log in to reply

Stirling's formula.

Then you can useLog in to reply

I'll try to list all such integer till n=6 by tmmrw.(through coding obviously)

Log in to reply