Summing the Mountains and Valleys of a Regular Polygon

  • Context: Graduate 
  • Thread starter Thread starter redount2k9
  • Start date Start date
  • Tags Tags
    Polygon Regular
Click For Summary

Discussion Overview

The discussion revolves around a mathematical problem involving a regular polygon with labeled vertices, where the labels are consecutive integers. Participants explore the relationship between the sums of "mountains" and "valleys" formed by these integers, specifically aiming to demonstrate that the difference between these sums equals n.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant proposes showing that a specific setup satisfies the condition of the problem and suggests that small modifications to the setup should maintain the difference between the sums of mountains and valleys.
  • Another participant discusses the possibility of finding a relation between the current number at a location in the polygon, the starting number, and the cumulative difference of sums up to that point.
  • A different viewpoint presents a graphical interpretation, stating that the problem can be visualized as a connected graph of line segments, where operations can be performed to simplify the graph while preserving the difference between the sums of peaks and pits.
  • One participant expresses a desire to understand the problem better and seeks help in solving it to achieve maximum points, while another participant accuses this request of being a form of cheating.

Areas of Agreement / Disagreement

Participants present various approaches and interpretations of the problem, indicating that multiple competing views remain. There is no consensus on a single method or solution to the problem.

Contextual Notes

Some assumptions about the properties of the integers and their arrangement may not be fully explored, and the implications of the proposed modifications to the setup remain unresolved.

redount2k9
Messages
12
Reaction score
0
In every top of a regular polygon with 2n tops there is written an integer number so the numbers written in two neighboring tops always differ by 1 ( the numbers are consecutive )
The numbers which are bigger than both of their neighbors are called ”mountains” and those which are smaller than both of their neighbors are called ” valleys ”
Show that the sum of mountains minus the sum of valleys is equal to n .
Thanks!
 
Physics news on Phys.org
One possible option: Show that some specific setup satisfies that condition, show that any possible single-number change (and maybe 1-2 other modifications) keeps that difference constant, and show that you can reach all possible setups with those modifications.

Another option: If you start at some point and go around the circle, can you find a relation between the current number at some location, the starting number and the difference (sum of mountains)-(sum of valleys) up to that location, or a similar relation?
 
if you graph this problem, you have a connected graph of line segments all of slope 1 or -1, starting at (0,0) and ending at (2n,0). You can redraw any portion of the graph where there occur consecutive peaks and pits to eliminate one peak and one pit, without changing the sum of peaks minus pits. This is a corollary of the fact that a rectangle illustrates vector addition, and in vector addition, the sum of the y coordinates is the y coordinate of the vector. performing a finite number of these operations changes the graph into one with one peak and no pits, hence sum of peaks minus sum of pits is the same as if there were only one peak and no pits, i.e. n. in other words the problem has the same answer as the simplest case, where the integers chosen increase from 0 to n, then decrease to 1. hence the only valley has integer 0 and the only peak has integer n.
 
Well I have to send this problem to a website and I think I have to make some calcules... I know that my goal is to understand how to solve it and not to receive the solution but is there anyone who can solve it so I can earn the maximum points? Thanks.
 
redount2k9 said:
Well I have to send this problem to a website and I think I have to make some calcules... I know that my goal is to understand how to solve it and not to receive the solution but is there anyone who can solve it so I can earn the maximum points? Thanks.

This is cheating and is not allowed here.
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
3K
Replies
2
Views
3K
  • · Replies 5 ·
Replies
5
Views
8K
Replies
6
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
Replies
7
Views
3K
Replies
15
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
23
Views
2K