🧭 New here?
Take a guided tour of the site.
← Back to Papers

Continue from this paper

Indexing is not verification. Extracted statements should be checked against the source.

Results & Lemmas (2)

Each result is auto-extracted from the paper via OCR - the math is shown verbatim and may carry occasional transcription artifacts. Click to expand the full statement.

LEMMA 1. LEMMA 1. [20] Let p=q If g(z) = w(z)G(z) where w(0) = 0 and |w(z)| < 1 in A, then dq = 0 and Jb-i p=q+l p=q
LEMMA 1. [20] Let p=q If g(z) = w(z)G(z) where w(0) = 0 and |w(z)| < 1 in A, then dq = 0 and Jb-i p=q+l p=q
LEMMA 2 OCR DOI/publisher footer hidden LEMMA 2. For a Axed integer m, m > 3, let __ _ (A-B)b-(j-2)B 2, and Then m - lE p=2 (2.1) -(p - I)2 (C(A, p))2 f [ M,) = i2 =2 PROOF: We…
LEMMA 2 . For a Axed integer m, m > 3, let __ _ \(A-B)b-(j-2)B\2 , and Then m - lE p=2 (2.1) -(p - I)2} (C(A, p))2 f [ M,) = i2 }=2 PROOF: We shall prove (2.1) by mathematical induction on m . A brief calculation shows that (2.1) holds for m = 3. Assume that (2.1) is valid for m = 4, 5, . . . , < — 1;
↑↓ navigate↵ openesc closeall results
✦ 291 explorers have wandered the registry - thanks for stopping by. Tell us what you'd like to see →
Usage & privacy

We use first-party site metrics to improve navigation: page visits, internal clicks, search result counts (not search terms), and approximate active time. A random tab ID groups events for seven days; GPC/DNT turns this off. The separate visitor count uses a self-hosted pseudonymous fingerprint and also respects GPC/DNT.

💬 Feedback