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

In this paper, we prove the lower bound for the number of balancingnon-Wieferich primes in arithmetic progressions. More precisely, for any giveninteger $r\geq2$ there are $\gg\log x$ balancing non-Wieferich primes $p\leq x$such that $p\equiv\pm1 \pmod{r}$, under the assumption of the $abc$ conjecturefor the number field $\mathbb{Q}(\sqrt{2})$. Further, we discuss someapplications of balancing sequences in cryptography.

A note on balancing sequences and application to cryptography