Strings of Zeros

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.

#NumberTheory

Note by Bryan Lee Shi Yang
6 years, 3 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

Not possible.

Suppose there does exist some n n where n2=800...001 n^2 = 800...001 . Then since 800..001 800..001 is odd, n n must. Therefore, n=2k+1 n = 2k + 1 . Then,

(2k+1)2=800...001 (2k + 1)^2 = 800...001

4k2+4k+1=800..001 4k^2 + 4k + 1 = 800..001

4k(k+1)=800...001 4k(k+1) = 800...001

k(k+1)=200...000 k(k+1) = 200...000

k(k+1)=22t5t k(k+1) = 2 * 2^t*5^t for some t>1 t > 1

k(k+1)=2t+15t k(k+1) = 2^{t+1}*5^t

Now, gcd(k,k+1)=1 \gcd(k,k+1) = 1 .Also, since 5t>2t+1 5^t > 2^{t+1} , we must have k+1=5t k+1 = 5^t and k=2t+1 k = 2^{t+1} . But, we can easily prove that 5t>2t+1+1 5^t > 2^{t+1} + 1 for t>1 t > 1 . Therefore, we have a contradiction, and there exist no integer n n for which n2=800...001 n^2 = 800...001

Siddhartha Srivastava - 6 years, 3 months ago

Log in to reply

Nice solution

A Former Brilliant Member - 6 years, 3 months ago

Nice solution :)

Calvin Lin Staff - 6 years, 2 months ago
×

Problem Loading...

Note Loading...

Set Loading...