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 $n&gt;1$ be a positive integer and $p$ be the smallest prime divisor of $n$. Let $S$ be a sequence of elements from ${\Bbb Z}_n={\Bbb Z}/n{\Bbb Z}$ of length $n+k$ where $k\geq {n\over p}-1$. If every element of ${\Bbb Z}_n$ appears in $S$ at most $k$ times, we prove that there must be a subsequence of $S$ of length $n$ whose sum is zero when $n$ has only two distinct prime divisors.

An Addition Theorem on the Cyclic Group ${\Bbb Z}_{p^\alpha q^\beta}$