Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
We note that every positive integer N has a representation as a sum of distinct members of the sequence ${d(n!)}_{n≥1}$, where d(m) is the number of divisors of m. When N is a member of a binary recurrence $u = {uₙ}_{n≥1}$ satisfying some mild technical conditions, we show that the number of such summands tends to infinity with n at a rate of at least c₁logn/loglogn for some positive constant c₁. We also compute all the Fibonacci numbers of the form d(m!) and d(m₁!) + d(m₂)! for some positive integers m,m₁,m₂.
2
Content available remote

Some Parity Statistics in Integer Partitions

81%
EN
We study integer partitions with respect to the classical word statistics of levels and descents subject to prescribed parity conditions. For instance, a partition with summands $λ₁ ≥ ⋯ ≥ λ_k$ may be enumerated according to descents $λ_i > λ_{i+1}$ while tracking the individual parities of $λ_i$ and $λ_{i+1}$. There are two types of parity levels, E = E and O = O, and four types of parity-descents, E > E, E > O, O > E and O > O, where E and O represent arbitrary even and odd summands. We obtain functional equations and explicit generating functions for the number of partitions of n according to the joint occurrence of the two levels. Then we obtain corresponding results for the joint occurrence of the four types of parity-descents. We also provide enumeration results for the total number of occurrences of each statistic in all partitions of n together with asymptotic estimates for the average number of parity-levels in a random partition.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.