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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $t(n)$ denote the number of $1$-bits in the base-$2$ representation of$n$, taken modulo $2$. We show how to prove the classic conjecture of LeoMoser, on the rarefied sum $\sum_{0\leq i<n} (-1)^{t(3i)}$, using tools fromautomata theory and logic. The same technique can be used to prove resultsabout analogous sums.

Rarefied Thue-Morse Sums Via Automata Theory and Logic