Proving Sum of Reciprocal of Natural Numbers is Not an Integer

Click For Summary
SUMMARY

The discussion centers on proving that the sum of the reciprocals of natural numbers, represented as \(\sum_{k=1}^{n} \frac{1}{k}\), is not an integer for \(n > 1\). Participants explored various approaches, including bounding the sum with integrals and analyzing its factorial representation. The conclusion emphasizes that despite attempts to find a contradiction using the expression \(\frac{(n-1)! + n(n-2)! + n(n-1)(n-3)! + ... + n!}{n!}\), a definitive proof remains elusive.

PREREQUISITES
  • Understanding of harmonic series and its properties
  • Familiarity with factorial notation and operations
  • Basic knowledge of integral calculus for bounding sums
  • Experience with mathematical proof techniques
NEXT STEPS
  • Research the properties of harmonic numbers and their integer characteristics
  • Study the relationship between sums and integrals in mathematical analysis
  • Explore advanced proof techniques in number theory
  • Learn about the implications of factorial growth in combinatorial mathematics
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in the properties of series and integrals.

Dragonfall
Messages
1,023
Reaction score
5
How do I show that [tex]\sum_1^n\frac{1}{k}[/tex] is not an integer for n>1? I tried bounding them between two integrals but that doesn't cut it. I know that [tex]\sum_1^n\frac{1}{k}=\frac{(n-1)!+n(n-2)!+n(n-1)(n-3)!+...+n!}{n!}[/tex] but I can't get a contradiction.
 
Physics news on Phys.org

Similar threads

Replies
7
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 22 ·
Replies
22
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K