Results 1 to 10 of about 654 (59)
Arithmetic convolution sums derived from eta quotients related to divisors of 6
The aim of this paper is to find arithmetic convolution sums of some restricted divisor functions. When divisors of a certain natural number satisfy a suitable condition for modulo 12, those restricted divisor functions are expressed by the coefficients ...
Ikikardes Nazli Yildiz+2 more
doaj +1 more source
A short note on Layman permutations
A permutation p of [k] = {1, 2, 3, …, k} is called Layman permutation iff i + p(i) is a Fibonacci number for 1 ≤ i ≤ k. This concept is introduced by Layman in the A097082 entry of the Encyclopedia of Integers Sequences, that is the number of Layman ...
Hajnal Péter
doaj +1 more source
In this paper, singularly perturbed differential equations having both small and large delay are considered. The considered problem contains large delay parameter on the reaction term and small delay parameter on the convection term.
Debela Habtamu Garoma+1 more
doaj +1 more source
Proofs, generalizations and analogs of Menon’s identity: a survey
Menon’s identity states that for every positive integer n one has ∑ (a − 1, n) = φ (n)τ(n), where a runs through a reduced residue system (mod n), (a − 1, n) stands for the greatest common divisor of a − 1 and n, φ(n) is Euler’s totient function, and τ(n)
Tóth László
doaj +1 more source
The multinomial convolution sum of a generalized divisor function
The main theorem of this article is to evaluate and express the multinomial convolution sum of the divisor function σr♯(n;N/4,N){\sigma }_{r}^{\sharp }\left(n;\hspace{0.33em}N\hspace{-0.08em}\text{/}\hspace{-0.08em}4,N) in as a simple form as possible ...
Park Ho
doaj +1 more source
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 include Pochhammer symbols, Fibonacci and Lucas numbers and many more.
Gryszka Karol
doaj +1 more source
Collatz conjecture revisited: an elementary generalization
Collatz conjecture states that iterating the map that takes even natural number n to n2{n \over 2} and odd natural number n to 3n + 1, will eventually obtain 1. In this paper a new generalization of the Collatz conjecture is analyzed and some interesting
Gutierrez Amauri
doaj +1 more source
Avian immunoglobulin-producing cell lines [PDF]
The present invention involves a method for preparing antibody-producing chicken cell clones. This method comprises a series of steps including initially immunizing a first chicken with a desired antigen.
Humphries, Eric H.
core +1 more source
There is a body of work in the literature on various restricted sums of the number of divisors of an integer function including that described in [2-9, 11] and summarised in Section 2 ...
Broughan, Kevin A.
core +2 more sources
A Note about Iterated Arithmetic Functions [PDF]
Let $f\colon\mathbb{N}\rightarrow\mathbb{N}_0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p^{\alpha})
Defant, Colin
core +2 more sources