Lesson plan

Dirichlet hyperbola method

In number theory, the Dirichlet hyperbola method is a technique to evaluate the sum : F(n) = \sum_{k=1}^n f(k) . The first step is to find a pair of functions and such that, using Dirichlet convolution, we have ; the sum then becomes : F(n) = \sum_{k=1}^n \sum_{xy=k}^{} g(x) h(y), where the inner sum runs over all ordered pairs of positive integers such that . In the Cartesian plane, these pairs lie on a hyperbola, and when the double sum is fully expanded, there is a bijection between the terms of the sum and the lattice points in the first quadrant on the hyperbolas of the form , where runs over the integers : for each such point , the sum contains a term , and vice versa. Let be a real number, not necessarily an integer, such that , and let . Then the lattice points can be split into three overlapping regions: one region is bounded by and , another region is bounded by and , and the third is bounded by and . In the diagram, the first region is the union of the blue and red regions, the second region is the union of the red and green, and the third region is the red. Note that this third region is the intersection of the first two regions. By the principle of inclusion and exclusion, the full sum is therefore the sum over the first region, plus the sum over the second region, minus the sum over the third region. This yields the formula

Back to article

Article summary

In number theory, the Dirichlet hyperbola method is a technique to evaluate the sum : F(n) = \sum_{k=1}^n f(k) . The first step is to find a pair of functions and such that, using Dirichlet convolution, we have ; the sum then becomes : F(n) = \sum_{k=1}^n \sum_{xy=k}^{} g(x) h(y), where the inner sum runs over all ordered pairs of positive integers such that . In the Cartesian plane, these pairs lie on a hyperbola, and when the double sum is fully expanded, there is a bijection between the terms of the sum and the lattice points in the first quadrant on the hyperbolas of the form , where runs over the integers : for each such point , the sum contains a term , and vice versa. Let be a real number, not necessarily an integer, such that , and let . Then the lattice points can be split into three overlapping regions: one region is bounded by and , another region is bounded by and , and the third is bounded by and . In the diagram, the first region is the union of the blue and red regions, the second region is the union of the red and green, and the third region is the red. Note that this third region is the intersection of the first two regions. By the principle of inclusion and exclusion, the full sum is therefore the sum over the first region, plus the sum over the second region, minus the sum over the third region. This yields the formula

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.