<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>In this article, we derive a great number of identities involving the <italic>ω</italic> function counting distinct prime divisors of a given number <italic>n</italic>. These identities also include Pochhammer symbols, Fibonacci and Lucas numbers and many more.</p>
</abstract>

In this article, we derive a great number of identities involving the ω function counting distinct prime divisors of a given number n. These identities also include Pochhammer symbols, Fibonacci and Lucas numbers and many more.

Identities Arising from Binomial-Like Formulas Involving Divisors of Numbers

Annales Mathematicae Silesianae

This work is licensed under the Creative Commons Attribution 4.0 International License.

{"article-title":"Identities Arising from Binomial-Like Formulas Involving Divisors of Numbers"}

In this article, we derive a great number of identities involving the ω function counting distinct prime divisors of a given number n. These identities also...

Identities Arising from Binomial-Like Formulas Involving Divisors of Numbers

Publié en ligne: 26 juil. 2023

Pages: 266 - 293

Reçu: 03 janv. 2023

Accepté: 13 juil. 2023

DOI: https://doi.org/10.2478/amsil-2023-0013

Mots clés
divisor, multiplicative function, symmetric polynomial, Fibonacci numbers, Stirling numbers

© 2023 Karol Gryszka, published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Identities Arising from Binomial-Like Formulas Involving Divisors of Numbers

Publié en ligne: 26 juil. 2023

Pages: 266 - 293

Reçu: 03 janv. 2023

Accepté: 13 juil. 2023

DOI: https://doi.org/10.2478/amsil-2023-0013

Mots clésdivisor, multiplicative function, symmetric polynomial, Fibonacci numbers, Stirling numbers

© 2023 Karol Gryszka, published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Mots clés
divisor, multiplicative function, symmetric polynomial, Fibonacci numbers, Stirling numbers