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

Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we showthat for a fixed integer $y$ there exists at most one integer exponent $a>0$such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ inpositive integers satisfying $n>m>0$, unless $y=2,3,4,6$ or $10$.

Sums of Fibonacci numbers that are perfect powers