Mathematical Induction: Showing Sums of 3 Consecutive Integers

Click For Summary
SUMMARY

The discussion demonstrates that in any arrangement of the integers from 1 to 30 on a circular disk, there must exist three consecutive integers whose sum is at least 45. By defining sums of three consecutive integers as \(s_i\) and assuming all \(s_i < 45\), a contradiction arises when calculating the total sum of these sums, leading to the conclusion that at least one \(s_i\) must be greater than or equal to 45. Furthermore, it is established that for any integers arranged in a circle, there must be \(r\) adjacent integers whose sum is at least \(\frac{1}{2}r(n+1)\).

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with circular arrangements of integers
  • Basic knowledge of summation formulas
  • Ability to manipulate inequalities
NEXT STEPS
  • Study mathematical induction techniques in depth
  • Explore properties of circular permutations in combinatorics
  • Learn about inequalities and their applications in number theory
  • Investigate generalizations of sums of consecutive integers
USEFUL FOR

Mathematicians, educators, students studying number theory, and anyone interested in combinatorial proofs and mathematical reasoning.

dwyane wade
Messages
1
Reaction score
0
On the outside rim of a circular disk the integers from 1 through 30 are painted in
random order. Show that no matter what this order is, there must be three successive
integers whose sum is at least 45.
 
Physics news on Phys.org
Hi dwayne wade.

Let the integers be $a_1,a_2,\ldots,a_{30}$ as arranged around the the disc, and let
$$s_1\ =\ a_1+a_2+a_3 \\ s_2\ =\ a_2+a_3+a_4 \\ s_3\ =\ a_3+a_4+a_5 \\ \vdots \\ s_{28}\ =\ a_{28}+a_{29}+a_{30} \\ s_{29}\ =\ a_{29}+a_{30}+a_1 \\ s_{30}\ =\ a_{30}+a_1+a_2.$$
Suppose to the contrary that all the sums are less than 45, i.e. $s_i<45$ for all $i=1,\ldots,30$. Then
$$\sum_{i=1}^{30}s_i\ <\ 30\cdot45\ =\ 1350.$$
But
$$\sum_{i=1}^{30}s_i\ =3(a_1+\cdots+a_{30})\ =\ 3(1+\cdots30)\ =\ 3\cdot\frac{30\cdot31}2\ =\ 1395\ >\ 1350.$$PS: It can be shown that there must be three adjacent numbers on the disc whose sum is at least $47$. In general, if the integers $1,\ldots,n$ are arrange in a circle, in any order, there must be $r$ adjacent ones whose sum is at least $\frac12r(n+1)$.
 
Last edited:

Similar threads

  • · Replies 5 ·
Replies
5
Views
4K
Replies
12
Views
2K
  • · Replies 66 ·
3
Replies
66
Views
7K
  • · Replies 11 ·
Replies
11
Views
4K
Replies
1
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
2
Views
2K
  • · Replies 23 ·
Replies
23
Views
4K
  • · Replies 7 ·
Replies
7
Views
10K