6th Day: Solve this interesting problem

Thanks to all who join this discussion.

Note by Sayan Chaudhuri
8 years, 1 month ago

No vote yet
3 votes

  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

sorry not to see anyone to join this interesting question....did you think that i copied from a book?.....NOPE!!.....i just created this problem myself ...... respond to this teasing problem of number theory......

Sayan Chaudhuri - 8 years, 1 month ago

Log in to reply

awesum yar....then also y u think always bad as i saw on post "1+1"?

A Former Brilliant Member - 8 years, 1 month ago

wow-_-...

the Destroyer - 8 years, 1 month ago

Log in to reply

why....r u delighted....?......to see the question or to see my comments to urge you to participate.....?.....is this problem a child's play to you.....!?!....i could not understand you.....:(

Sayan Chaudhuri - 8 years, 1 month ago

Observe that the parity of the sum changes every move.As the number of moves is 2n-1 which is odd, the parity of the remaining integer is opposite that of the original parity of sum.

The sum is initially (2n)(2n-1)/2 which is n(2n-1). Thus if n is even, the remaining integer is odd; and if n is odd the remaining integer is even.

Gabriel Wong - 8 years, 1 month ago

Log in to reply

..thanx a lot....would you please elaborate a little more about the idea about the parity of the sum changes and the conclusion.....regards....

Sayan Chaudhuri - 8 years, 1 month ago

Log in to reply

Let the sum of the elements be S. Observe that when x and y are removed, S becomes S-x-y+abs(x-y)+1.

Observe that abs(x-y) - x - y is always even. Thus S and S-x-y+abs(x-y)+1 are of opposite parity.

There are 2n-1 steps to remove 2n-1 elements, leaving 1 final integer. As the parity of the sum changes with every step, it changes 2n-1 times and thus ends up opposite the original.

The rest is simple.

Gabriel Wong - 8 years, 1 month ago

Log in to reply

@Gabriel Wong ok. got to it.....thanx a lot....

Sayan Chaudhuri - 8 years, 1 month ago

when i take n as 1 the answer is even but it comes odd when i take n as 2.

Aditya Parson - 8 years, 1 month ago

Log in to reply

how?

A Former Brilliant Member - 8 years, 1 month ago

Log in to reply

let n be 1 that means we have 1,2. So if you solve the two we get 2 according to question. now when n=2 we have 1,2,3,4. which if you evaluate comes to 1.

Aditya Parson - 8 years, 1 month ago

Log in to reply

@Aditya Parson ok thankssss but genuinely i didn't got the question what it says....

A Former Brilliant Member - 8 years, 1 month ago

Log in to reply

@A Former Brilliant Member I can explain, provided you are online for a while?

Aditya Parson - 8 years, 1 month ago

Log in to reply

@Aditya Parson yeah i am plz do xplain it.....i am really thankful to u....:)

A Former Brilliant Member - 8 years, 1 month ago

Log in to reply

@A Former Brilliant Member the problem states that let there be integers 1 to 2n. now you can at random pick any two integers between 1 and 2n and then apply the algorithm. The result of the algorithm replaces the two integers which were previously there. You continue to do this until there is only a single integer left.

Aditya Parson - 8 years, 1 month ago

Log in to reply

@Aditya Parson ohkkk.......now i got it........thank u so much....:)

then i support u for the answer u have given.....

A Former Brilliant Member - 8 years, 1 month ago
×

Problem Loading...

Note Loading...

Set Loading...