Intriguing problem

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

Find the largest integer nn such that n!<an!<a for some positive integer aa having nn digits.

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

Note by Nihar Mahajan
3 years, 6 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Sort by:

Top Newest

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

A Former Brilliant Member - 3 years, 6 months ago

Log in to reply

That was indeed surprising LOL

Nihar Mahajan - 3 years, 6 months ago

Log in to reply

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

A Former Brilliant Member - 3 years, 6 months ago

Log in to reply

Sure!

Nihar Mahajan - 3 years, 6 months ago

Log in to reply

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

Nihar Mahajan - 3 years, 6 months ago

Log in to reply

There is no one-formula for this question.

Pi Han Goh - 3 years, 6 months ago

Log in to reply

If we include some relation between aa and nn then? For example: if aa has nn digits.

Nihar Mahajan - 3 years, 6 months ago

Log in to reply

@Nihar Mahajan Then you can use Stirling's formula.

Pi Han Goh - 3 years, 6 months ago

Log in to reply

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

Harsh Shrivastava - 3 years, 6 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...