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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let P be a set of n points in ℝ3, not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n-7 different directions if n is even and at least 2n-5 if n is odd. The bound for odd n is sharp.

Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space