How Do You Prove the Inequality Involving Primes and Harmonic Sum for POTW #337?

  • Context: Undergrad 
  • Thread starter Thread starter Euge
  • Start date Start date
Click For Summary
SUMMARY

The discussion revolves around proving the inequality involving primes and the harmonic sum for Problem of the Week #337. The inequality states that for primes \( q_1, \ldots, q_r \) in the interval \([1, n]\), the expression \(\prod_{j = 1}^r \left(1 - \frac{1}{q_j}\right)\sum_{k = 1}^n \frac{1}{k} < 1\) holds true. This conclusion is drawn from the properties of prime numbers and their relationship with the harmonic series. No solutions were provided by participants, highlighting the complexity of the problem.

PREREQUISITES
  • Understanding of prime numbers and their distribution
  • Familiarity with harmonic sums and series
  • Basic knowledge of mathematical inequalities
  • Experience with mathematical proofs and logic
NEXT STEPS
  • Study the properties of prime numbers and their density in number theory
  • Explore the concept of harmonic sums and their applications
  • Learn about mathematical inequalities and proof techniques
  • Investigate related problems in number theory, such as the Prime Number Theorem
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in advanced mathematical proofs involving primes and harmonic sums.

Euge
Gold Member
MHB
POTW Director
Messages
2,072
Reaction score
245
Here is this week's POTW:

-----
Suppose $q_1,\ldots, q_r$ are the primes in the interval $[1, n]$ where $n$ is an integer $> 1$. Prove

$$\prod_{j = 1}^r \left(1 - \frac{1}{q_j}\right)\sum_{k = 1}^n \frac{1}{k} < 1$$-----

Remember to read the https://mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to https://mathhelpboards.com/forms.php?do=form&fid=2!
 
Physics news on Phys.org
No one answered this week's problem. You can read my solution below.
Note $$\prod_{j = 1}^r \frac{1}{1 - \frac{1}{q_j}} = \sum_{m_1 \ge 0} \sum_{m_2 \ge 0}\cdots \sum_{m_r \ge 0} \frac{1}{q_1^{m_1}q_2^{m_2} \cdots q_r^{m_r}} = \sum_{k\in S} \frac{1}{k}$$ where $S$ is the set of all positive integers $k$ whose prime factors are no greater than $n$. Since $$\sum_{k\in S} \frac{1}{k} > \sum_{k = 1}^n \frac{1}{k}$$it follows that $$\prod_{j = 1}^r \frac{1}{1 - \frac{1}{q_j}} > \sum_{k = 1}^n \frac{1}{k}$$ and therefore $$\prod_{j = 1}^r \left(1 - \frac{1}{q_j}\right) \sum_{k = 1}^r \frac{1}{k} < 1$$ as desired.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K