Help ...

What is the remainder if 12+32+52++201121^{2} + 3^{2} + 5^{2} + \cdots+ 2011^{2} is divided by 8?

There must be an easy way to solve this. But I couldn't remember that! Help me to find the correct path ...

#NumberTheory

Note by Raiyun Razeen
5 years, 5 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

Although I have provided a solution before, I discovered a much quicker way to do it. If you put them into pairs, it will be

(12+32)+(52+72)+(92+112)++(20092+20112)(1^2+3^2)+(5^2+7^2)+(9^2+11^2)+\dots+(2009^2+2011^2)

This may be written into the form of

n=1503((4n3)2+(4n1)2)=n=1503(32n232n+10)\sum_{n=1}^{503}((4n-3)^2+(4n-1)^2) = \sum_{n=1}^{503}(32n^2-32n+10)

Since 8328|32, all it matters to find the reminder is

n=150310=5030=8(628)+6\sum_{n=1}^{503}10 = 5030 = 8(628)+6

Hence, the reminder is 6

Kay Xspre - 5 years, 5 months ago

Log in to reply

Nice pairing.

I'm not sure what your central equation is about, since neither of the expressions depend on nn. Can you edit it accordingly?

Calvin Lin Staff - 5 years, 5 months ago

Log in to reply

Ouch, thanks Calvin. It supposed to be nn but I am too familiar with xx when writing the expression. I'll edit them now.

Kay Xspre - 5 years, 4 months ago

Log in to reply

@Kay Xspre I still believe that the equation is wrong. Notice that the RHS is summing up a constant, and doesn't depend on nn. Is this intentional?

Calvin Lin Staff - 5 years, 4 months ago

Log in to reply

@Calvin Lin I suppose to write it with nn by not substituting 503. This is then fixed.

Kay Xspre - 5 years, 4 months ago

Log in to reply

@Kay Xspre Looks good now :) Thanks!

Calvin Lin Staff - 5 years, 4 months ago

If you apply remainder theorem then remainder of 1^2 , 3^2 , 5^2 , 7^2 .............2011^2 when divided by 8 seperately will all equal to 1. so their will be 1006 times 1 .which totals 1006. Then remainder of 1006/8 =6. So the remainder will be 6.

Anshul Sanghi - 5 years, 5 months ago
×

Problem Loading...

Note Loading...

Set Loading...