Is it as easy as it looks?

Prove that the square of any positive integer is in the form of either \(3m+1\) or \(3m\) for some integer \(m\).

n2n^{2} = 3m+13m+1

or

n2n^{2} = 3m3m

I couldnt get this, so decided to post it to see if anyone knows how it can be done Post your proofs below please :)

#NumberTheory #Is_It_aS_eaSy_as_it_looks_? #Simple_proofs #N_Squares

Note by Chinmay Raut
6 years, 10 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

So this question could also be phrased, show that n^2 is 0 or 1 modulo 3.

The great thing about modulo is that you can multiply things. So we only need to try n being 0, 1, 2 modulo 3.

2^2 = 4 = 1 mod 3 The other two are trivial and left as an exercise for the reader.

Nathan Edwards - 6 years, 10 months ago

Log in to reply

Thknx

Chinmay Raut - 6 years, 10 months ago

FIRST- a^2={3q}^2 a^2=9q^2 a^2=3(3q^2) a^2=3m,where m=3q^2 SECOND- a=3q+1 a^2={3q+1}^2 a^2=9q^2+1+2(3q*1) a^2=9q^2+1+6q a^2=3(3q^2+2q)+1 a^2=3m+1,where m=3q^2+2q

Anmol Singh - 6 years, 10 months ago

Log in to reply

Thnks

Chinmay Raut - 6 years, 10 months ago
×

Problem Loading...

Note Loading...

Set Loading...