Perfect squares

49,4489,444889,44448889.................49, 4489, 444889, 44448889................. In the series of the above numbers following the same pattern, prove that, each of these are whole squares of integers..

#NumberTheory #PerfectSquare #sequence

Note by Sagnik Saha
7 years, 1 month 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

Tn=44444....(ntimes)88888...(n1times)9T_n = 44444....(n times) 88888... (n-1 times)9

=49×(10n1)×10n+89×(10n11)×10+9= \frac{4}{9}\times(10^n-1) \times 10^n + \frac{8}{9} \times(10^{n-1}-1) \times 10 + 9

=19(4×(10n1)×10n+8(10n11)×+81)= \frac{1}{9}({ 4\times(10^n-1)\times10^n + 8(10^{n-1}-1)\times + 81})

=19(4×102n4×10n+8×(10n10)+81)= \frac{1}{9}{( 4 \times 10^{2n} - 4 \times 10^n + 8 \times(10^n - 10) + 81)}

=19(4×102n4×10n+8×10n80+81)= \frac{1}{9}{( 4\times10^{2n} - 4\times10^n + 8 \times 10^n - 80 + 81)}

=19(4×102n+4×10n+1)= \frac{1}{9}{( 4\times10^{2n} + 4 \times 10^n + 1)}

=19[(2×10n)2+2×(2×10n)+12]= \frac{1}{9}[(2\times10^n)^2 + 2\times (2\times10^n) + 1^2]

=19(2×10n+1)2= \frac{1}{9}(2\times10^n + 1)^2

=(2×10n+13)2= (\dfrac{2 \times 10^n +1}{3})^2

Now note

21(mod3)2 \equiv -1 (\mod{3} ) and

101(mod3)    10n1(mod3)10 \equiv 1 (\mod{3} ) \implies 10^n \equiv 1 (\mod{3} )

    2×10n1(mod3)\implies 2\times10^n \equiv -1 (\mod{3} )

    2×10n+10(mod3)\implies 2\times10^n + 1 \equiv 0 (\mod{3} ) or

32×10n+13 | 2\times10^n + 1.

This maybe proved by induction as well. Thus (210n+1)/3{(2*10^n + 1)/3} is an integer and thus TnT_n is a perfect square for all n.

Sagnik Saha - 7 years, 1 month ago

:) 9801,998001,99980001,9999800001,.....

Ritabrata Roy - 2 years, 10 months ago
×

Problem Loading...

Note Loading...

Set Loading...