Study of Some Functions with Their Applications Using Weird Numbers (Zwain Weirdness Filter)
Main Article Content
Abstract
A detailed analytical approach, using the structural study of Euler's function, (n), and the divisor sum function, σ (n), is developed in this work to investigate the property of weird numbers. Here, multiples that fail to be smooth are termed weird. Weird numbers are a special class with two basic properties: abundance and non-semi perfectness. A positive integer is called abundant if the sum of its proper factors is greater than the number; otherwise, it is called weird if no subset of proper factors adds up to the number. The identification of weird numbers has traditionally depended on computationally expensive cursive subset-sum computations, not breaking any numbers down into odd chunks; it is impractical to efficiently break up large integers. This can be compared for greater/lesser or equal for integers of different magnitudes. We focus on integers of the form n = 2k p q and extend to . Explicit formulas for the function (n) and the function σ (n), and the change of these in multiplicative form into the form of asymptotic with some error bounds are found. A significant one is the filtering quantity, which is an initial sign of oddness. Based on the numerical results, the accuracy of the approximations is verified, and the effectiveness of the proposed filter is ensured, which is a framework that can be extended to detect odd numbers in a scalable manner.
Downloads
Article Details

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.