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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

We investigate here sums of triangular numberswhere  T n   is the  n th triangular number. We show that for a set of positive integers  S , there is a finite subset  S  0  such that  f  represents  S  if and only if  f  represents  S  0 . However, computationally determining  S  0  is ineffective for many choices of  S . We give an explicit and efficient algorithm to determine the set  S  0  under certain generalized Riemann hypotheses, and implement the algorithm to determine  S  0  when  S  is the set of all odd integers.

Representing Sets with Sums of Triangular Numbers