Fixed points of the sum of divisors function on \({{\mathbb{F}}}_2[x]\)
نویسندگان
چکیده
We work on an analogue of a classical arithmetic problem over polynomials. More precisely, we study the fixed points \(F\) sum divisors function \(\sigma : {\mathbb{F}}_2[x] \mapsto {\mathbb{F}}_2[x]\) (defined mutatis mutandi like usual integers) form \(F := A^2 \cdot S\), \(S\) square-free, with \(\omega(S) \leq 3\), coprime \(A\), for \(A\) even, whatever degree, under some conditions. This gives characterization \(5\) \(11\) known \(\sigma\) in \({\mathbb{F}}_2[x]\).
منابع مشابه
the effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
Iterating the Sum-of-Divisors Function
1991 Mathematics Subject Classi cation: 11A25, 11Y70 Let 0(n) = n and m(n) = ( m 1(n)), where m 1 and is the sum-of-divisors function. We say that n is (m; k)perfect if m(n) = kn. We have tabulated all (2; k)-perfect numbers up to 109 and all (3; k)and (4; k)-perfect numbers up to 2 108. These tables have suggested several conjectures, some of which we prove here. We ask in particular: For any ...
متن کاملRemarks on fibers of the sum-of-divisors function
Let σ denote the usual sum-of-divisors function. We show that every positive real number can be approximated arbitrarily closely by a fraction m/n with σ(m) = σ(n). This answers in the affirmative a question of Erdős. We also show that for almost all of the elements v of σ(N), the members of the fiber σ−1(v) all share the same largest prime factor. We describe an application of the second resul...
متن کاملSome Problems of Erdős on the Sum-of-divisors Function
Let σ(n) denote the sum of all of the positive divisors of n, and let s(n) = σ(n)− n denote the sum of the proper divisors of n. The functions σ(·) and s(·) were favorite subjects of investigation by the late Paul Erdős. Here we revisit three themes from Erdős’s work on these functions. First, we improve the upper and lower bounds for the counting function of numbers n with n deficient but s(n)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasnik Matematicki
سال: 2022
ISSN: ['1846-7989', '0017-095X']
DOI: https://doi.org/10.3336/gm.57.2.04