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$ be a primitive non-deficient number where $n=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$ where $p_1, p_2 \cdots p_k$ are distinct primes. We provethat there exists an $i$ such that $$p_i^{a_i+1} < 2k(p_1p_2p_3\cdots p_k).$$We conjecture that in fact one can always find an $i$ such that ${p_i}^{a_i+1}< p_1p_2p_3\cdots p_k$.

Must a primitive non-deficient number have a component not much larger than its radical?