Greedy Sums and Dirichlet Series
Abstract
We prove that the greedy sum of a direct product of two numeric arrays of complex numbers is equal to the product of the greedy sums of the factors provided that all the mentioned sums exist.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.