Waste less time on Facebook — follow Brilliant.
×

Is it possible to evaluate?

\[\sum_{n=1}^{\infty}\frac{\gcd(n,2015)}{\gcd(n,2016)}\]

Note by Chinmay Sangawadekar
1 year, 5 months ago

No vote yet
1 vote

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

Since \(\mathrm{gcd}(n,2015) \ge1\) and \(\mathrm{gcd}(n,2016)\le2016\), we have \[ \frac{\mathrm{gcd}(n,2015)}{\mathrm{gcd}(n,2016)} \; \ge \; \tfrac{1}{2016} \] for all \(n\), and so the infinite series must diverge.

Mark Hennings - 1 year, 5 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...