Number Theory - Show harmonic numbers are not integers

Click For Summary

Homework Help Overview

The discussion revolves around proving that the sum of the harmonic series, specifically 1 + 1/2 + 1/3 + ... + 1/n, is not an integer for n > 0. The subject area is number theory, focusing on properties of integers and prime numbers.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss various methods to prove the non-integrality of the harmonic sum, including the use of p-adic valuations and specific cases involving prime numbers. Questions arise regarding the conditions under which the sum is evaluated, particularly the interpretation of n > 0 versus n > 1.

Discussion Status

The discussion is active, with participants offering different approaches and questioning assumptions about the values of n. Some guidance is provided regarding the use of prime numbers and theorems related to their distribution, though no consensus has been reached on a single method.

Contextual Notes

There is a noted ambiguity regarding the definition of n, as one participant points out that for n = 1, the sum is an integer, which may affect the overall argument. Additionally, the mention of Erdős' work introduces a historical context that may influence the discussion.

viren_t2005
Messages
20
Reaction score
0
Q.Prove that 1+1/2+1/3+1/4+...+1/n is not an integer.n>0
 
Physics news on Phys.org
There are a couple ways to prove this that I know of. Your title says number theory so if you have discussed in class (or read on your own) p-adic valuations, try to show that for a fixed n>1 the 2-adic valuation is always greater than 1. If you don't have experience with this, try the sum where n=p (some prime). Make an argument (manipulate terms) why this isnt' an integer. Then fix that p, and pick an x between p and 2p-1, and follow a similar argument. Unfortunately you now must prove that for any x such a p exists. I believe this was proven by Erdos. Maybe your teacher will let you get away with that as justification. Another way is to show that for some n, the sum=(even number + odd number)/2N *odd number which isn't an integer.
 
I think you mean n > 1. If it's just n > 0, then the sum for n = 1 should not be an integer, but that sum is just 1, which clearly is an integer.
 
Is there a theorem that you know that says that (for large enough m), there is always a prime number between m and 2m?

Carl
 

Similar threads

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