English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Several years ago the second author playing with different "recognizers ofreal constants", e.g., the LLL algorithm, the Plouffe inverter, etc. foundempirically the following formula. Let $p_n/q_n$ denote the $n$th convergent ofthe continued fraction of the constant $e$, then $$ \sum_{n \geq 0} |q_n e -p_n| = \frac{e}{4} \left(- 1 + 10 \sum_{n \geq 0} \frac{(-1)^n}{(n+1)! (2n^2 +7n + 3)}\right). $$ The purpose of the present paper is to prove this formulaand to give similar formulas for some powers of $e$.

Variations on an error sum function for the convergents of some powers of $e$