81 is a square number. Find the minimum number of zeros needed to be inserted between 8 and 1 such that it makes another perfect square, or prove that it is impossible.
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.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
# 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"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
Not possible.
Suppose there does exist some n where n2=800...001. Then since 800..001 is odd, n must. Therefore, n=2k+1. Then,
(2k+1)2=800...001
4k2+4k+1=800..001
4k(k+1)=800...001
k(k+1)=200...000
k(k+1)=2∗2t∗5t for some t>1
k(k+1)=2t+1∗5t
Now, gcd(k,k+1)=1.Also, since 5t>2t+1, we must have k+1=5t and k=2t+1.
But, we can easily prove that 5t>2t+1+1 for t>1. Therefore, we have a contradiction, and there exist no integer n for which n2=800...001
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:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
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
Not possible.
Suppose there does exist some n where n2=800...001. Then since 800..001 is odd, n must. Therefore, n=2k+1. Then,
(2k+1)2=800...001
4k2+4k+1=800..001
4k(k+1)=800...001
k(k+1)=200...000
k(k+1)=2∗2t∗5t for some t>1
k(k+1)=2t+1∗5t
Now, gcd(k,k+1)=1.Also, since 5t>2t+1, we must have k+1=5t and k=2t+1. But, we can easily prove that 5t>2t+1+1 for t>1. Therefore, we have a contradiction, and there exist no integer n for which n2=800...001
Log in to reply
Nice solution
Nice solution :)