Keçeci Numbers and the Keçeci Prime Number

preprint OA: closed
Full text JSON View at publisher
Full text 7,374 characters · extracted from preprint-html · click to expand
Keçeci Numbers and the Keçeci Prime Number | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 2 June 2025 V1 Latest version Share on Keçeci Numbers and the Keçeci Prime Number Author : Mehmet Keçeci 0000-0001-9937-9839 [email protected] Authors Info & Affiliations https://doi.org/10.22541/au.174890181.14730464/v1 246 views 128 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract Keçeci Numbers (first defined: July 27, 2022) constitute a unique numerical system that generates sequences based on specific initial conditions and a set of iterative rules. This system relies on a complex interplay of fundamental arithmetic operations (addition), special divisibility rules (periodically dividing by 2 or 3), and the primality properties of numbers. One of the most notable aspects of Keçeci Numbers is their definability across various number sets, such as integers, rational numbers, negative numbers, complex numbers, and quaternions, exhibiting distinct behaviours in each. This offers a rich ground for investigating how fundamental number theoretic principles manifest within different algebraic structures. The "Keçeci Prime Number" refers to the number (or its positive integer representative, based on the absolute value of its real or scalar part, according to the number type) that is prime and appears most frequently within the generated Keçeci Number sequence. This value can be interpreted as a kind of "characteristic signature" or "condensation point" regarding the sequence's structure. The potential significance of Keçeci Numbers lies not in being an established sequence, but in providing a "computational laboratory" for exploring how fundamental concepts in number theory (divisibility, primality, arithmetic progression) can generate new and unpredictable patterns under specific constraints and conditions. The application of such rules, particularly in higher-dimensional number systems like complex numbers and quaternions, might produce sequences exhibiting fractal-like structures or chaotic behaviour. Such sequences could potentially inspire models for certain dynamic systems in theoretical physics, or new designs for pseudo-random number generators in signal processing engineering or cryptography. As Keçeci Numbers are still in an exploratory phase, their true value will emerge with deeper mathematical analysis in the future (e.g., concerning the long-term behaviour of the sequences, their limits, periodicity, or the distribution of Keçeci Prime Numbers). Such original numerical systems demonstrate that mathematics is not only about solving existing problems but is also a self-enriching discipline that generates new structures and questions. This can serve as a source of motivation, reminding students and researchers of the vast, unexplored territories within the infinite world of numbers. Supplementary Material File (kececi_numbers_and_the_kececi_prime_number-31052025-0.pdf) Download 1.36 MB Information & Authors Information Version history V1 Version 1 02 June 2025 Copyright This work is licensed under a Creative Commons Attribution 4.0 International License Keywords algorithmic number generation complex numbers iterative processes kececinumbers keçeci numbers keçeci prime number number sequences quaternions rational numbers Authors Affiliations Mehmet Keçeci 0000-0001-9937-9839 [email protected] View all articles by this author Metrics & Citations Metrics Article Usage 246 views 128 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Mehmet Keçeci. Keçeci Numbers and the Keçeci Prime Number. Authorea . 02 June 2025. DOI: https://doi.org/10.22541/au.174890181.14730464/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.174890181.14730464/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9ffc29dcd991df88',t:'MTc3OTQ1NjUwMQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00