Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

General Divisibility Algorithms

Version 1 : Received: 2 February 2024 / Approved: 5 February 2024 / Online: 5 February 2024 (08:02:06 CET)

How to cite: KAYA, C.K. General Divisibility Algorithms. Preprints 2024, 2024020238. https://doi.org/10.20944/preprints202402.0238.v1 KAYA, C.K. General Divisibility Algorithms. Preprints 2024, 2024020238. https://doi.org/10.20944/preprints202402.0238.v1

Abstract

In my paper, a divisibility rule named the Queen function is de- scribed, which has been generalized for every integer and encompasses all pre- viously established divisibility rules. Subsequently, the paper discusses other areas where this function is instrumental. These include simplifying ratios, generating prime numbers, and more. Towards the end of the paper, a set of hypotheses is also presented. Among these, the most significant is the novel approach involving the application of the Queen function for prime number generation.

Keywords

Arithmetic Functions; Discrete Mathematics; Primes; Number Theory

Subject

Computer Science and Mathematics, Algebra and Number Theory

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.