<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Ammar Moussa on Medium]]></title>
        <description><![CDATA[Stories by Ammar Moussa on Medium]]></description>
        <link>https://medium.com/@ammar.moussa?source=rss-fab4b2a1ea7f------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*5v1isdfkFoluLSyvqo5o0A.jpeg</url>
            <title>Stories by Ammar Moussa on Medium</title>
            <link>https://medium.com/@ammar.moussa?source=rss-fab4b2a1ea7f------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 20 Nov 2026 14:57:26 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@ammar.moussa/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[The Modern Math Crissies: (1) The Identity Crisis]]></title>
            <link>https://medium.com/@ammar.moussa/the-modern-math-crissies-1-the-identity-crisis-caf789f4b4fc?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/caf789f4b4fc</guid>
            <category><![CDATA[philosophy]]></category>
            <category><![CDATA[crisis]]></category>
            <category><![CDATA[math]]></category>
            <category><![CDATA[identity]]></category>
            <category><![CDATA[mathematics]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Sun, 07 Dec 2025 00:56:14 GMT</pubDate>
            <atom:updated>2025-12-07T00:56:14.613Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/264/1*e51FQg0ZA5tC_F0LFDIzHw.png" /></figure><p>Since its earliest origins, mathematics has been closely tied to the quest for understanding reality. The ancient Greeks and the Muslim scholars, for instance, saw mathematics as a means to uncover the fundamental truths of the universe. This view framed math as something to be discovered — truths that existed independently of human invention.</p><p>However, with the rise of formalism in the modern era, particularly from the late 19th century onwards, mathematics underwent a profound transformation. No longer just a tool for describing reality, math began to be a powerful system capable of creating its own truths within a presumably self-contained set of axioms that can even create its own virtual worlds. In this new framework, mathematics is not just about uncovering the truths of the world; it can now generate its own reality, independent of the physical universe.</p><p>This shift gave rise to an identity crisis in mathematics. Is mathematics discovered or created? Does mathematics discovers truth or create it? The answer in both cases became increasingly complex, though it can be summarized in one word: “<strong>Both</strong>”.</p><p>Now, that is not necessarily a bad thing. Actually, it is very beneficial from many perspectives. But it raises a serious problem. While math still serves as a profound means of describing the world around us, its power to invent abstract structures and systems has blurred the line between what we call a truth and what we can call a mathematical truth. That line kept blurring more and more until most people and even many mathematicians fail to distinguish them anymore, and this has some serious implications even on math itself.</p><p>For example, what counts as a proof of a truth? Or what does a truth even mean anymore? What exactly <em>is</em> a “<strong>mathematical truth</strong>”? If a statement is true within the confines of a formal system, does it count as “<strong>truth</strong>” in the broader sense? And how do we reconcile this with empirical truth, the kind of truth that governs the real world?</p><p>Even the presumed mathematical truth itself becomes problematic. In the beginning, a proof was seen as a rigorous, logical demonstration of a truth that could not be questioned. But as we have expanded our understanding of different mathematical systems, the concept of what constitutes a “<strong>proof</strong>” has become more complex. Can a proof in one formal system be transferred to another system? What happens when different formal systems lead to contradictory conclusions, even though each one is internally consistent?</p><p>This is where the nature of <em>mathematical truth</em> becomes even more complicated. In the modern landscape, proofs often rely on intricate and highly abstract constructions that can be difficult to relate to any physical or intuitive understanding of the world. Even some basic theorems have become so complex that they require immense computational power to verify.</p><p>In this sense, mathematical truth is sometimes less about a clear, intuitive grasp and more about the formal structure of logical systems, which raises questions about what it means to <em>know</em> something to be true in mathematics after all. It also leaves us with difficult questions about what it means to <em>know</em> anything in the mathematical sense, and what it means to “prove” something in a world where truths are not always fixed or universally accessible.</p><p>To make it even worse, let us first distinguish between <strong>evidence</strong> and <strong>proof</strong>. Evidence is anything that provides a reason to believe a statement is likely true. Evidence can take many forms: probabilistic heuristics, empirical observations and measurements, mechanical or structural arguments, philosophical reasoning, or even a formal mathematical demonstration. A demonstration itself is simply a procedure that shows how a statement follows from a set of chosen axioms within a particular system. It does not automatically speak about the truth of the world — it only speaks about truth within that system.</p><p>A proof, by contrast, is the point at which evidence — whether a single piece or a collection — grants a person certainty that a statement is true.</p><p>Historically, proof was a broader and more flexible concept, rooted in the accumulation of compelling reasons. But with the rise of formalism, mathematics began to equate proof strictly with formal demonstration, merging the two concepts and subtly redefining both. As a result, many came to believe that whatever can be formally demonstrated must be true, and whatever cannot be formally demonstrated cannot be believed as true. This shift, while elegant on the surface, hides a deep weakness at the heart of formalism.</p><p>The foundational problem is the contradiction that the formal systems themselves rest on axioms that are not formally proven. These axioms are accepted because they seem inevitable or reasonable — not because they follow from some more authoritative source. Formalism demands that everything else must follow rigidly from axioms, yet it offers no demonstration of why the axioms should be trusted in the first place. Who said that all truth must come from those axioms!! No one ever provided a reason for why this idea in particular is true or even likely true!! Actually, we have strong evidences that the opposite is the case.</p><p>Even more troubling is that many truths that are strongly supported by other forms of evidence — structural, empirical, intuitive, or philosophical — are dismissed as “<strong>unproven</strong>” simply because they lack a formal derivation.</p><p>Ironically, formal demonstration is <strong>not inherently more valid</strong> than empirical evidence; it simply operates over a broader hypothetical domain. But outside the specific axiom system it belongs to, even the strongest demonstration has no guaranteed force. In this way, the modern obsession with formal demonstration has narrowed our conception of proof and sidelined many legitimate forms of knowing.</p><p>So here comes a serious question, by whose authority formalists have claimed their authority to determine what is acceptable and what is not? As a simple man with less than an average IQ, the only conclusions I could come up with was that the Europeans have colonized math and no one dared to question it since then :) …</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=caf789f4b4fc" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Structural Analysis of the Primes’ Main PH Wave]]></title>
            <link>https://medium.com/@ammar.moussa/structural-analysis-of-the-primes-main-ph-wave-f439c0e04b89?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/f439c0e04b89</guid>
            <category><![CDATA[twin-prime-conjecture]]></category>
            <category><![CDATA[number-theory]]></category>
            <category><![CDATA[goldbach-conjecture]]></category>
            <category><![CDATA[prime-numbers]]></category>
            <category><![CDATA[mersenne-prime]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Sat, 06 Dec 2025 02:42:38 GMT</pubDate>
            <atom:updated>2025-12-06T02:42:38.583Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/440/1*7Bp_6VfsGeHGdy3_tf4uig.png" /></figure><p>The sieve of Eratosthenes is usually understood as a sequential filtering procedure. However, we demonstrated before that the sieve could instead be modeled as a superposition of periodic PH-functions (pulse waves) (see <a href="https://medium.com/@ammar.moussa/modeling-the-sieve-of-eratosthenes-using-ph-waves-aff628ad76a2">Modeling the Sieve of Eratosthenes Using PH Waves</a>), transforming it into a dynamical system, from which prime numbers emerge as a result of that dynamic process rather than being static floating objects (see <a href="https://medium.com/@ammar.moussa/reframing-the-origin-of-prime-numbers-the-sieve-principle-d9b95157eb45">Reframing the Origin of Prime Numbers</a>) , and then we derived some <a href="https://medium.com/@ammar.moussa/insights-from-analyzing-primes-ph-waves-0365f41f0608">insights from that model</a>. This shift in viewpoint reveals structural patterns that are invisible in the traditional formulation and today we focus on <strong>the Main PH Wave</strong> (The <strong>Mod 2</strong> Wave) which forms the <strong><em>initial configuration</em></strong> for further wave interaction.</p><p>The Main Wave wave immediately enforces a critical constraint through the Cascaded Containment of Contribution by neutralizing all higher waves of even numbers, and thus all primes greater than 2 must be odd — that is, they must be of the form <strong>2k±1</strong>. While this sounds trivial, this constraint alone saves 50% of any computations and storage needed to run the sieve algorithm. However, more importantly here, it introduces a remarkably rich structure:</p><ul><li>With the exception of 2 and 3, no two consecutive numbers can both be prime.</li><li><strong>It initially sets all odd numbers to be twin prime candidates</strong> by being adjacent to another odd candidate. That is, every surviving number in the form 2k±1 is a potential twin member, pending interference from higher waves. <strong>The Twin Prime Conjecture</strong> thus gains structural support: if intervals exist where higher waves’ interference is silent, twin primes would persist. Proving the Twin conjecture would require showing that the interactions of the sieve waves necessarily guarantee that such <strong>quiet</strong> windows (i.e., gaps unaffected by higher waves) exist infinitely often.</li><li>It <strong>initially sets numbers of specific forms </strong>— such as (2^n) — 1, where n is prime (<strong>Mersenne</strong> candidates), and (n²) + 1, where n is an even number — as prime candidates, pending interference from higher waves. Thus, the infinite existence of such primes gains structural support: whenever interferences from higher waves are absent around their generating values, those primes persist. Proving this would require showing that PH wave interactions necessarily produce such quiet windows infinitely often.</li><li>The elimination of all even numbers bigger than 2 enforces that the unique new eliminations caused by any prime p &gt; 2 must take the form of p+2kp (its odd multiples). This causes all subsequent waves — that follow the main wave — to preserve the symmetric structures established by all shorter waves around the even numbers they overlap.</li><li>It also <strong>enforces an initial state of symmetric primality around each number n</strong>, for the pairs within the interval [2, 2n-2], pending interference from higher waves. This makes <strong>the Goldbach conjectur</strong>e a default state unless higher waves can break all symmetric pairs around some numbers.</li><li><strong>Every prime p</strong> &gt; 3 can be written as a <strong>shift from a smaller prime</strong> px by 2k ∈ ℕ, that is:</li></ul><p><strong>p = px + 2k</strong></p><p>This identity holds for all odd numbers by default, and therefore applies to all primes greater than 2 without exception. Again, although this sounds trivial, it can be interpreted in some important ways:</p><ul><li>It allows primes to be understood in <strong>relative motion</strong>, mirrors how prime constellations can be thought of as <strong>paths</strong>, not just absolute points.</li><li>Any two prime numbers p and p′ will be symmetric around some midpoint m, that is:</li></ul><p><strong>p = m — k , p′ = m + k</strong></p><p>This aligns with the Goldbach conjecture core requirement for primes’ symmetry, and supports it structurally — though it does not prove it, as it does not prove the opposite, that this symmetry exists for every m ∈ ℕ.</p><ul><li><strong>There exist infinitely many numbers n</strong> with primes symmetric around them. To make this argument constructive, we can apply a brute-force substitution approach:</li></ul><p>- Let p=pmax, the largest prime under consideration.</p><p>- Let p1 be the next smallest prime.</p><p>- Then: pmax = p1 + 2k</p><p>- Repeat: pmax = p2 + 2k, pmax = p3 + 2k, …, pmax = 3 + 2k</p><p>- Then: p1 = p2 + 2k, p1 = p3 + 2k, …, p1 = 3 + 2k</p><p>- Repeat:</p><p>p2 = p3 + 2k, p2 = p4 + 2k, …, p2 = 3 + 2k</p><p>…</p><p>This cascading process continues until all primes can be expressed as shifts from smaller primes as we reach 5 = 3 + 2k.</p><p>This iterative shift logic implies that <strong>symmetric prime pairs</strong> (not necessarily consecutive) appear around numbers from 3 up to pmax, forming a dense region of symmetry, even though <strong>it does not guarantee</strong> that every number n lies within such a symmetric configuration.</p><p>This symmetry directly supports the core of the Goldbach Conjecture, though a full proof would require ensuring that higher-order waves never erase all valid symmetric prime pairs around any given number, and preserve at least one symmetric pair of primes around each number.</p><ul><li>This identity also offers a partial structural insight into both the Twin and the Polignac’s conjectures as it can be seen as a generalized proven case of them where primes are not necessarily consecutive. This is true because the rule encompasses consecutive primes as well.</li></ul><p>We can conclude here that the sieve of Eratosthenes is an evolving system whose initial state naturally generates the underlying structure of some major prime-number conjectures. The first wave enforces a large-scale geometric symmetry across the integers. This symmetry is so strong that the the Goldbach conjecture emerge naturally from the initial configuration — before any higher waves begin acting.</p><p>In general: The Goldbach symmetry, the Twin prime adjacency, Generalized Polignac spacing, and the Mersenne-form primality, are not exotic or fragile patterns. <strong>They are the default state of the dynamical sieve system</strong>. Higher waves merely determine which of these default structures survive by erasing or preserving the geometric structure inherited from the Main Wave.</p><p>In other words, these conjectures stand as true by default unless a proof or any evidence demonstrates that they could fail (or at least an argument indicating that such a change is plausible). This is further reinforced by the overwhelming empirical verification.</p><p>This is not yet a proof, but it is evidence of strong structural support: the sieve begins in a fully friendly configuration for these conjectures. The dynamical sieve presents these conjectures not as isolated mysteries but as consequences of the system’s inherent structure. The question becomes not why these conjectures should be true, but whether the higher-wave interactions can ever fully erase the default configurations they begin with.</p><p>This reframing opens a new analytic path: instead of trying to directly prove the existence of certain prime structures, we analyze whether the dynamical system is capable of destroying them completely. If not, their infinite persistence follows naturally.</p><p><strong>These conjectures are true unless the dynamical system destroys them, not true because the system carefully builds them. They are not anomalies but the baseline geometry of the sieve system.</strong></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=f439c0e04b89" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Insights from Analyzing Primes’ PH Waves]]></title>
            <link>https://medium.com/@ammar.moussa/insights-from-analyzing-primes-ph-waves-0365f41f0608?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/0365f41f0608</guid>
            <category><![CDATA[number-theory]]></category>
            <category><![CDATA[mathematics]]></category>
            <category><![CDATA[riemann-hypothesis]]></category>
            <category><![CDATA[prime-numbers]]></category>
            <category><![CDATA[waves]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Sat, 06 Dec 2025 00:52:57 GMT</pubDate>
            <atom:updated>2025-12-06T00:52:57.198Z</atom:updated>
            <content:encoded><![CDATA[<p>Previously I introduced <a href="https://medium.com/@ammar.moussa/modeling-the-sieve-of-eratosthenes-using-ph-waves-aff628ad76a2">The PH Waves Model for the Sieve of Eratosthenes.</a> I summarize here a few interesting insights developed through investigating the model and tracing the PH waves. While the core of most of these insights is not entirely novel, the perspective that emerges from the PH waves model offers a new way of perceiving the behavior of prime numbers.</p><h3>General Observed Dynamics</h3><p>The preliminary tracing and analysis of the PH waves showed some general dynamics that reflect the well-known nature and behavior of the sieve. The following is a brief overview of these dynamics.</p><ul><li><strong>Cascaded Containment of Contribution</strong></li></ul><p>Each wave inherently includes the effect of all waves based on its multiples, and thus prevents them from contributing entirely new numbers to the composite set. This is the equivalent of the known fact that only primes can introduce new composites, which gives the primes their unique observed characteristic as factors or atoms of the multiplication process. The reason behind this is that the multiples are already composites and composite numbers cannot mark entirely new composites — if the number is a multiple of a composite, then it must also be a multiple of one of the values composing it (i.e., a multiple of one of its factors).</p><ul><li><strong>Cascaded Delay of Contribution</strong></li></ul><p>The wave of a newly introduced prime p does not immediately contribute unique new hits, as its effectiveness is deferred until the wave reaches a point unclaimed by earlier prime waves. This point is always the square of p, which resembles a phase shift by p2. This is the equivalent of the known fact that a newly introduced prime only starts contributing uniquely to the composite set at its square. That is, its first unique elimination occurs at p2.</p><ul><li><strong>Cascaded Capping of Error Margin</strong></li></ul><p>Each newly introduced wave lowers the upper bound of the error margin. This margin is measured here as the uncertainty in the candidate set prior to further restriction, representing the cost of not knowing which numbers will be further filtered by subsequent waves.</p><h3>The Infinite Desynchronization of Prime Waves</h3><p>The process that defines and identifies prime numbers is inherently deterministic. However, a deterministic process does not necessarily yield a simple, periodically repeating output. The apparent irregularity in prime distribution is a consequence of complex, rather than simple, deterministic interactions. The PH functions, which represent the multiplicative effects of natural numbers, operate as individual waves. At any given number x, the combined effect of these waves determines primality.</p><p>Because no number can be divisible by all smaller numbers — or by all smaller primes [1] — the waves associated with those smaller numbers never synchronize all at once before or at x.</p><p>A simple periodic pattern requires all contributing waves to synchronize at some point. True synchronization for a finite set of waves occurs for the first time at their least common multiple (LCM). However, as the natural numbers extend infinitely, new primes are continuously introduced into the sieving process as fundamental divisors. This continuous addition of new frequencies or components to the global wave means the system is in a perpetual state of evolution. Before a full cycle of the combined wave can be completed based on a finite set of divisors, new divisors emerge, adding new periodicities and disrupting any potential simple repetition.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/660/0*DV6E3CMCrWzgqXjQ" /></figure><p>Consequently, the wavelength of this major wave effectively grows without bound. Its calculated frequency continuously diminishes, yet it never achieves a true, repeating cycle. This dynamic behavior explains why we observe no simple periodic pattern for the primes or the gaps between them in any finite segment of the number line.</p><p>It is impossible for the process, as defined, to settle into any simple periodic pattern. If such a pattern ever existed, it could not result from primality alone, but rather from a synergy of primality with another mathematical structure.</p><p>Therefore, any rule governing the distribution of primes cannot be a fixed or simple one, but a tunable or evolving pattern might exist — one that reflects this continuous evolution as x grows. That tunable rule can be a function of x that is based on more than just the four basic operations — addition, subtraction, multiplication, and division.</p><p>This also inherently reflects known properties of prime numbers: As numbers grow larger, the density of composite hits increases due to the accumulation of smaller divisors. This cumulative filtering leads to primes becoming increasingly sparse, yet still unbounded. And despite the increasing scarcity, the major wave of the sieving process never ceases; its infinite, multiplicative-divisive nature guarantees that new primes will always emerge — consistent with Euclid’s theorem on the infinitude of primes.</p><p>The implication of the continuous evolution is that the complete blueprint for the order and distribution of all prime numbers does not reside within any finite domain, but rather conceptually at infinity. The observed sequence of primes is an unfolding of this infinite, conceptually pre-determined order.</p><p>This reflects the fact that the primality wave is the complement of the compositeness wave — it flows in the opposite direction, from infinity toward 2. This also explains why we find it easier to articulate asymptotic statements about primes than to articulate accurate ones within the finite domain.</p><h3>The Composites Matryoshka</h3><p>While the distribution of prime numbers resists simple characterization, the formation of composite numbers follows a unique deterministic and evolving structure, which results in a predictable distribution of the primes. Tracing the patterns of composites formed by the PH waves reveals interesting patterns that are probably well known individually but the analysis of the PH waves shows them combined and unified in one big body, and leads to some important insights.</p><p>The set of primes up to some number n eliminates composite numbers in a recurring pattern that repeats at the multiples of the least common multiple (LCM) of those primes (the multiples of the primorial of n (written as n#)). Let us call this <strong>the Primorial Pattern</strong>.</p><p>Inside the Primorial Pattern, smaller sub-patterns repeat more frequently, each corresponds to smaller subsets of primes (e.g., pairs, triplets, etc.) that repeat at the multiples of their own LCM.</p><p>The Primorial Pattern itself repeats c times within the period of the LCM of all the numbers up to n, forming a bigger pattern, and let us call it <strong>the Super Primorial Pattern</strong>. Here, c is equal to the LCM of all numbers up to n divided by the LCM of all primes up to n. In other words, the Super Primorial Pattern contains the Primorial Pattern as a sub-pattern that repeats c times within it.</p><p>Now, the Super Primorial Pattern repeats at the multiples of the LCM of all numbers up to n regardless of what later waves dictate.</p><p>Additionally, the repetition of any of those patterns mentioned above at the multiples of the LCM of their components means that each of them would also form a bigger pattern — consisting of their repetitions — that will repeat in turn at the multiples of the product of these components.</p><p>Note: If that felt confusing, trying to follow on the hit map sample in the figure below might make it easier to grasp it.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*Y_JCY9Qaez1E8O85" /></figure><p>We simply can say that within the number line, patterns repeat periodically: Each prime p defines a repeating pattern with period p. Pairs, triplets, and larger sets of primes define patterns that repeat every LCM of those primes. These patterns fit into larger ones — like meshes within meshes — producing a horizontally nested structure. This creates a self-similar (fractal-like) hierarchy of repeating composite patterns.</p><p>In other, more precise words, all these patterns are <strong>horizontally nested from one perspective and overlapping from the other</strong>, forming a fractal-like periodic structure where smaller periodicities are embedded within larger ones, and overlapping each other.</p><p>Moreover, this pattern nesting is <strong>vertically recursive</strong> because unlike electing primes, which is a collective action, eliminating composites is an independent process that each wave performs regardless of what other waves dictate. That is, when a new prime joins the process, <strong>it does not invalidate the existing structure but merely augments it with new periodic eliminations at a longer wavelength and lower frequency</strong>.</p><p>The new composite eliminations introduced by higher primes modify the prior patterns only slightly, because their contribution to new composite generation diminishes rapidly. Since each new prime contributes an increasingly smaller proportion of entirely new composites, their influence on the overall sieve structure is increasingly marginal as x grows.</p><p>In other words, whenever a new prime joins the process, it will generate patterns that are repetitions of the prior patterns with a minor modification. Thus, the prior patterns are also nested vertically within the pattern formed by this new prime. That means that the new prime changes the rules — that define what numbers are actually primes — only in a very small ratio that progressively decreases as x grows.</p><p>This layering of new primes over old ones is the vertical recursion — each new prime wraps the previous pattern inside a slightly modified outer shell, forming a vertically nested hierarchy. The whole recursively nested structure is akin to Russian dolls (Matryoshka) — where each new prime introduces a structure that contains all previous ones within it, modified only slightly by the new layer. Each of those prior patterns contains more repeating patterns within them, which in turn contain even more patterns within them and so on. That is why we refer to this structure as <strong>the Composites Matryoshka</strong>.</p><p>Put simply, the overall pattern resembles the nested patterns resulting from a stack of layered wire meshes, where each layer has a unit width larger than the layer beneath it by exactly one length unit. Each number n creates its own periodic mesh of hits and spaces (period n of hits). When you stack all of them on top of each other, you get the composite pattern from the hits.</p><p>It is worth noting here thatthe Composites Matryoshkais the structure where <strong>the Chinese Remainder Theorem</strong> stems from and lives within.</p><h3>Fading Fluctuation</h3><p>The Composites Matryoshka carries a powerful implication: any snapshot of the sieve taken at a particular level — say, after the inclusion of numbers up to n — provides an approximation of primality in the next repetition of its pattern with a predictable margin of error.</p><p>For example, after the first wave (Mod 2), the sieve correctly excludes 50% of numbers as non-primes, and the remaining candidates have a 50% chance of being prime. Including the Mod 3 wave improves the approximation further; the periodic structure repeats every 6 numbers (LCM of 2 and 3), leaving ~33.33% chance of error in identifying primes based on that pattern. If the snapshot includes all numbers up to the LCM of those whose composite contribution totals 99%, that yields a pattern with only 1% uncertainty in the next repetition — an error margin of just 1%.</p><p>As more waves are added from the Refinement Level (primes with long wavelengths and low composite impact), this margin narrows further: 0.01%, 0.001%, and so on. Thus, expanding the range of numbers used in the sieve gives increasingly precise approximations of the prime distribution (which numbers are likely to be primes, the sequence of gaps between primes, and the number of primes at x — π(x)).</p><p>This implies that as x grows, the change in the rules that govern primality becomes less frequent and more regular, and thus the error bound continues to decay. Consequently, the apparent chaos of prime distribution is highest near number 2 and <strong>fades</strong> as x increases. <strong>The system becomes less turbulent, not more, as we move toward infinity.</strong></p><p>In a precise sense, the primality wave flowing from infinity toward 2 produces more regular and less apparently chaotic behavior in the direction of infinity where that chaos is at its minimum level. Thus, the maximum irregularity and chaotic behavior from our perspective will be at the beginning of the number line near number 2, where we find it hard to pin down this area under the rules of our average approximations. This can also be explained by the fact that the higher waves with low frequencies, which keep the frequency of fluctuations small, turn off consecutively as x decreases.</p><p>Interestingly, the change in rules as x increases occurs smoothly and relatively slowly compared to x. That is a result of several factors synergized: First, only primes can mark new composites and change the rules because of the Cascaded Containment of Contribution. Second, a new prime does not immediately generate new composites when introduced, its first elimination happens at its square due to the Cascaded Delay of Contribution.</p><p>That is true for each newly introduced prime, but with growing wavelengths and decreasing frequencies, which means that interference is increasingly delayed as x grows.</p><p>Additionally, the fact that no two consecutive numbers can both be primes, and that no three or more consecutive odd integers can all be prime, makes the change even slower, resulting in much less interference to the current pattern. The net result is that the rate of change becomes progressively slower and smoother as x grows.</p><p>This diminishing rate of change, combined with the decreasing effect of higher waves in marking new composites — in terms of quantity, again due to the Cascaded Containment of Contribution — directly implies that the error in estimation decays in a similarly slow and smooth manner as x grows.</p><p>This implies a key structural insight: any sufficiently good approximation of prime distribution (such as x/ln(x), x/(ln(x)-1), and Li(x)) — that captures the core of the distribution, even if not precisely — will exhibit a decaying error ratio as x grows. That is, the ratio between the estimation error and x decays as x increases.</p><p>Namely, the error bound grows more slowly than x. The rate of decay depends on the accuracy of the approximation itself: the more precise it is, the faster the decay rate becomes. Thus, the amplitude of fluctuation about that approximation fades out as x grows.</p><p>This insight matched the available data about the error of the famous approximations of π(x) compared to x, as shown in the table.</p><p>Now, while the following does not form a rigorous technical demonstration, it provides a strong insight that worth noting. Considering the following points:</p><ul><li>The logarithmic integral Li(x) was empirically shown to capture the core of the prime distribution, as it correctly reflects a good average in the most irregular or chaotic portion of the number line.</li><li>Any approximation that captures the core of the prime distribution should exhibit a continually decreasing error bound as x grows.</li><li>The fluctuation between the sieve-generated prime count π(x) and the logarithmic integral Li(x) decays smoothly in the direction x→∞ — a structurally enforced decay, not merely an observed one.</li><li>Li(x) is a smooth monotonic function, further reinforcing its role as a stable estimator.</li><li>The sieve is very deterministic and imposes strict constraints on the emergence of new primes.</li><li>Riemann’s error bound , decays slower than the actual error of Li(x) when compared to the actual π(x).</li></ul><p>It is reasonable to say that as x grows it becomes increasingly implausible for the error ∣π(x) — Li(x)∣ to spike beyond the bound predicted by the Riemann Hypothesis. This suggests that Riemann’s bound is <strong>valid</strong> and <strong>safe</strong>, as the actual error of Li(x) appears to never exceed it. However, it also indicates that the bound <strong>may not be tight</strong>.</p><p>Thus, the sieve structure and the behavior of the decaying error provide structural and conceptual support for the Riemann Hypothesis by demonstrating that <strong>the actual prime distribution behaves in a more stable and bounded way than the RH bound requires</strong>.</p><p>This also gives another insight, at some point, as the error ratio keeps dropping with x growth, the value of π(x) and Li(x) will become so close that the tiny fluctuations of π(x) would push it to wiggle around Li(x), so it would keep getting a little smaller and a little larger of Li(x).</p><p>This will continue infinitely because Li(x) is smooth and monotonic, while π(x) has a fluctuating nature, even if it is a progressively decaying fluctuation, as it never cease due to the dynamics of the sieve itself. This matches the established fact about the sign of π(x) − Li(x) changes infinitely often by Littlewood’s theorem.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/644/0*vdPSFSWX9rzB8ul1" /></figure><p>[1] Because there always exists a prime p with ⌊x/2⌋ &lt; p &lt; x (by Bertrand’s Postulate proven by Chebyshev[14, 15]: For every integer n &gt; 1, there is at least one prime p such that n &lt; p &lt; 2n), that prime cannot divide x, proving that x cannot be divisible by all primes smaller than itself.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=0365f41f0608" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Modeling the Sieve of Eratosthenes Using PH Waves]]></title>
            <link>https://medium.com/@ammar.moussa/modeling-the-sieve-of-eratosthenes-using-ph-waves-aff628ad76a2?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/aff628ad76a2</guid>
            <category><![CDATA[sieve-of-eratosthenes]]></category>
            <category><![CDATA[model]]></category>
            <category><![CDATA[waves]]></category>
            <category><![CDATA[prime-numbers]]></category>
            <category><![CDATA[number-theory]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Fri, 05 Dec 2025 01:01:54 GMT</pubDate>
            <atom:updated>2025-12-05T01:01:54.585Z</atom:updated>
            <content:encoded><![CDATA[<p>Here we introduce the PH Waves Model, a conceptual framework for visualizing and understanding the dynamics of Sieve of Eratosthenes through interacting periodic signals. Introduction</p><p>Traditionally, the Sieve of Eratosthenes is viewed as a stepwise elimination process — a procedural method for filtering out composite numbers by marking the multiples of each prime number. I build a formal model of the sieve’s mechanism that provides an effective and meaningful visualization, allowing us to analyze its behavior.</p><p>The goal is to foster a new perception, intuition, and insights that may help reveal previously unnoticed phenomena — insights that could one day contribute to resolving long-standing open problems about primes that have resisted proof or disproof for centuries.</p><p>The sieve is reformulated here as a system of mathematical functions constructed from periodic structures capable of describing its behavior algebraically, where primality emerges as the result of interacting periodic signals. This formalism not only mirrors the sieve’s stepwise elimination process but also makes its structural logic explicit.</p><p>At the core of this formulation lies the <strong>PH function</strong> (Periodic Hit function), a modular pulse wave that activates at regular intervals defined by each number. This framework enables the construction of arithmetic functions for primality testing, prime counting, and prime indexing — revealing the underlying structure of primality as a composition of interacting periodic signals.</p><p>While these functions are computationally intensive and can be optimized using techniques such as restricting to primes, bounding by √x, or using other methods, they remain costly to compute for large inputs.</p><p>However, our focus here is not computational efficiency but rather a deeper understanding of how prime numbers emerge, while also considering the influence of composite numbers in that process. For this reason, we retain the general (or naive) form of the sieve, which examines all numbers without imposing restrictions or optimizations.</p><h3>The PH Waves Model</h3><p>The primary goal of this model is to <strong>formalize the sieve</strong> process as a compound wave composed of well-defined periodic components — an approach that may offer insight into the structure and distribution of prime numbers. Additionally, this serves as a general definition of the sieve process: one that generates all primes without requiring prior knowledge of which numbers are primes.</p><h3>The PH Function (Periodic Hit Function)</h3><p>The PH function is not newly introduced here; it is merely a periodic rectangular pulse train (or pulse wave) with period p and a duty cycle of 1/p.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/727/0*_EU74s_rIwfRv8ol" /></figure><p>A rectangular pulse train alternates between two values and can be concisely represented using an indicator function and the modulo operation. For a pulse train with period p, taking the value b when (t mod p) is in the interval [0,1), and the value a otherwise, we define:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/469/0*1pUe-LHCFEcamlDa" /></figure><p>Where 1[0,1)(x) is the indicator function, which equals 1 if x ∈ [0,1) and 0 otherwise. This formulation explicitly shows the dependency on the base value a, the pulse height difference (b − a), and the periodicity determined by p and the unit pulse width.</p><h3>Primality Test Functions</h3><p>Each possible divisor di of the number x, where 1 &lt; di &lt; x, can be represented as a rectangular pulse wave using the PH function by setting a=1 and b= 0, which makes the function output 0 only when x mod di = 0 and thus x can be divided by di.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/294/0*BpfYfWrQtbcCgg96" /></figure><p>The figure below shows how these waves correspond to the remainder values, as the intersection of the column (x) and row (di) gives x mod di , (e.g., 7 mod 5 = 2).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/456/0*Ioz49F_jceyjE0g_" /></figure><p>Each of these waves acts as a sub-frequency of a large <strong>compositeness </strong>wave composed of all those sub-frequencies. This wave leaves primes un-hit, forming a complementary wave of <strong>primality</strong>.</p><p>We can define a primality indicator function <em>IsPrime1 (x)</em> based on multiplicative filtering. The product of all the sub-frequency waves at point x results in 0 only if x is composite, as divisors’ waves will produce 0 and render the whole product zero. Otherwise, the product would give 1, indicating that x is prime.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/683/0*GEvIS2Usg1gEqEwO" /></figure><p>Another primality test function, <em>IsPrime2 (x)</em>, can be formed based on additive scoring. It gives a sense of primality — quantified by how many waves vote for x to be a prime — and is defined as the sum of all the sub-frequency waves at point x:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/738/0*l1LA1sUiVlqEMjqh" /></figure><p>x will be prime in this case if and only if the output of <em>IsPrime2 (x)</em> equals x — 2, which means that none of the waves represent a divisor. This follows since divisors range from 2 to x — 1, giving x — 2 tests in total</p><p><strong>x</strong> is prime ⟺ <strong><em>IsPrime2 (x)</em></strong>= x — 2</p><p>The <em>IsPrime2 (x)</em> function can be converted into <em>IsComposite (x)</em>, which gives a sense of compositeness, quantified by how many waves vote for x to be a composite (i.e., divisor count) by exchanging a and b in the PH function. It becomes:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/710/0*KaijKgmiogukO7Nj" /></figure><p>In this case, x is composite if and only if the output is greater than 0.</p><p><strong>x</strong> is composite ⟺ <strong><em>IsComposite (x)</em></strong> &gt; 0</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/500/0*CCqd5hK25-Do1Jzm" /></figure><h3>Primes Counting and Indexing Functions</h3><p>The value of π(x), the number of primes less than or equal to x, can be calculated by summing the values of <em>IsPrime1(n)</em> over n=2 to x, as each term will produce 1 if n is prime, and 0 otherwise:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/735/0*bgWkQyGOiSUmEz67" /></figure><p>Now we define the inverse: a function that returns the xth prime number, denoted as <em>Prime (x)</em>.</p><p>To construct this function, we rely on the fact that the xth prime is the smallest number n such that exactly x primes exist in the interval [2, n]. That is:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/723/0*qis-sG7y1gKjKcK8" /></figure><p>This can be simulated using a selector-based function that accumulates over the natural numbers and activates <strong>only when</strong> the number of primes found equals x.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/716/0*swDwK91BkvqflcFS" /></figure><p>where M is any bound large enough to contain the xth prime according to our current knowledge (e.g., M = 2·x·log(x) ).</p><p>This formula works by scanning forward through the natural numbers. The inner sum counts how many primes have appeared up to each n, and the delta ensures that what contributes to the total is only the n where π(n) = x.</p><p>Since δ returns 1 only when its argument is 0, the expression selects exactly one n, making:</p><p><strong><em>Prime (x)</em></strong> = n such that π(n) = x</p><h3>Decomposition of the Compositeness Wave</h3><p>Wave decomposition is often associated with Fourier transformations; however, in this case, the different components or frequencies of the compositeness wave are already distinctly separated.</p><p>Considering their wavelength, contribution, and tractability, the components of the compositeness wave can be divided into two main levels:<strong> The Fixed Primary Level (FPL)</strong> and <strong>The Scalable Secondary Level (SSL)</strong>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/645/0*trlhKU08ptSeiF_U" /></figure><p><strong>1.The Fixed Primary Level (FPL)</strong></p><p>This level contains the dominant lower waves with short-wavelength / high-frequency components that shape the bulk of compositeness. It includes the waves from the<strong> most impactful</strong> divisors, which account for the majority of all composite eliminations.</p><p>This level represents a fixed range because its constituent waves are always the first and strongest contributors in any sieve construction. They can be seen as defining the basic structure of compositeness and thus primality in turn.</p><p>The FPL is divided into two main sub-levels:</p><p>a. <strong>The Majority Level</strong>: This level is formed by combining<strong> the Main Wave</strong> (the wave of Mod 2) and <strong>the Co-Main Wave</strong> ( the wave of Mod 3). Together, these two waves mark a dominant portion of numbers — ~66.667% of all natural numbers — as composites and eliminate them, and thus clearly limits the number of primes to no more than ⅓ (~33.33%) of all natural numbers.</p><p>b. <strong>The Co-Majority Level:</strong> This level consists of the waves based on mod 5 to mod 11. We refer to it as the Co-Majority Level because, although it does not constitute a majority, it contributes significantly more than any of the remaining components or levels.</p><p>Collectively, the waves of this level dominate the sieve structure beyond the main pair, yet remain far more influential than any subsequent waves.</p><p>The combined contribution of the waves in this level accounts for ~12.56% of the total wave structure, making the FPL accountable for defining ~79.22% of all composites in total. This is based on the fact that only primes can define new composites, and that each prime p marks new composites in a ratio of 1/p of the remaining unmarked numbers left by earlier waves. This can be calculated using the formula:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/707/0*P6tH5uzK9HxydVhI" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/389/0*ywX4DeX9JZaIIJLy" /></figure><p>None of the waves that follow contributes more than 1.6% individually. In fact, the contribution ratio continues to decrease rapidly: the cumulative effect of marking composites reaches 90% of all natural numbers by the number 247, and it takes an astronomical prime to approach 99%.</p><p><strong>2. The Scalable Secondary Level (SSL)</strong></p><p>Beyond the core filters, the remaining waves contribute incrementally to the compositeness structure. These waves are marked not by dominance, but <strong>by precision and interference.</strong> They stand as increasingly fine-grained higher waves with long-wavelength / low-frequency that refine, distort, or interfere with the base structure.</p><p>As the sieve expands, more of these waves become active and relevant. While their individual contribution is small in magnitude, enough to be approximated or even sometimes ignored in bulk analysis, they remain essential in determining which specific numbers are ultimately elected as primes. Still, <strong>their cumulative contribution</strong> exerts an increasingly serious impact on bulk analysis as the sieve extends into higher domains.</p><p>This level includes three conceptual, scalable sublevels. Their ranges are not fixed, as they are more <strong>technical rather than mathematical classes</strong>. They should be scaled based on the targeted analysis depth and available computational resources.</p><p><strong>a. The Tangible Level</strong></p><p>These are the waves that remain computationally accessible and analyzable — visually or numerically — without the need for advanced or sophisticated computational instruments. While each contributes only a small fraction to the compositeness signal, their effect is still tangible in terms of adjusting the spacing and density of primes, enough to influence our approximation models, limiting the ratio of primes among natural numbers, and ceiling the error margin.</p><p><strong>b. The Refinement Level</strong></p><p>The waves in this level are at the practical limit of our advanced computational instruments’ ability to track. Their contribution becomes increasingly fine-grained, serving mostly to refine the primality of numbers that passed earlier filters. They shape the final results of our approximations including the ratio of primes and the error margin, but they leave little visible trace individually.</p><p><strong>c. The Interferences Level</strong></p><p>This level includes the longer waves that lie beyond our current computational reach, but contribute far less eliminations, influencing <strong>the unpredictability and oscillatory behavior</strong> of prime number distribution. These components may cause subtle, chaotic irregularities in prime gap patterns and density fluctuations beyond analytical reach. That leaves no choice but to consider them as<strong> interferences</strong> from the analytical perspective.</p><p>This classification reflects not only the relative contribution strength of each level’s waves to the compositeness signal, but also how analytically or computationally accessible each group is in practical terms.</p><h3>Basic Analysis of the Waves in the Fixed Primary Level (FPL)</h3><p>The basic analysis of the PH waves in the FPL shows the expected known behavior of the sieve. It also highlighted a possible role of a trivial fact about the Main Wave in introducing a rich structure, which we cover in the insights section. Following below is a summary of the conclusions of the basic analysis performed.</p><p>As stated earlier in 2.4, the Fixed Primary Level (FPL) contains the waves of both the Majority and the Co-Majority levels. In turn, the Majority level includes the Main Wave and the Co-Main Wave , and together they eliminate ~66.667% of all natural numbers as composites. Those two waves produce together the foundational pattern on which all other periodicities are layered. Their frequencies are high, their effect is strong, and their patterns are immediately observable.</p><p>The Mod 2 wave alone eliminates approximately 50% of all natural numbers by marking all even numbers as composites, and that is what makes it the main wave in the sieve. Its strength emerges from the fact that it is the earliest (the first to act) wave with the <strong>shortest wavelength</strong> and t<strong>he highest frequency</strong> among all waves in the sieve.</p><p>As the first wave to act on the number line, it plays a foundational role, setting the basic structure of compositeness that all subsequent waves build upon. Its act immediately enforces all primes greater than 2 to be odd — that is, they must be of the form: <strong>2k±1</strong>. Thus, number 2 becomes the only even prime, which is a well-known fact. While sounds trivial, the fact that all primes bigger than 2 must be odd can produce an interesting rich structure.</p><p>This wave also imposes a theoretical <strong>upper bound</strong> on the number of possible primes: no more than 50% of all numbers can qualify as prime candidates under its rule. It thus <strong>sets</strong> <strong>the primality ceiling</strong> and defines the initial error margin and the starting point for refining the sieve’s precision.</p><p>The Mod 3 wave contribution to the composite set does not constitute a majority on its own, but it still contributes significantly more than any remaining wave. The Mod 3 wave marks ⅓ of all numbers as composites. Considering that half of those are already marked by the Mod 2 wave, this means that the mod 3 wave marks ⅙ (~16.667%) of all natural numbers as new composites, in addition to those marked by the mod 2. No other remaining individual wave contributes more than 7%.</p><p>Additionally, the Mod 3 wave also limits the occurrence of consecutive odd primes: apart from the triplet (3, 5, 7); no three or more consecutive odd integers can all be prime, as one must fall on a multiple of 3.</p><p>The strong influence of the Majority Level is very clear in the strict definition for all higher primes to be restrictively in the form of <strong>6k ± 1</strong>. These two waves restrict the structure of the possible primes’ positions to be around the multiples of their LCM. That is, every prime &gt;3 must be writable in the form 6k ± 1, but of course, the opposite is not true — not all numbers writable in that form must be primes — as more of these possible primes will be marked as composites by higher waves.</p><p>The Majority level limits the number of primes to no more than ~33.33% of all natural numbers, and caps the error margin to be the same ratio.</p><p>The waves of the Co-Majority level add additional layers to the base wave, modifying the spacing of primality zones and shaping local patterns. The most notable effect of this level is the impact of its first wave The Mod 5, which marks all its multiples as composites. Considering that all 10’s multiples — including 100s’, 1000s’,… and so on — are already marked by the Mod 2 wave, this means that primes &gt; 5 can only exist in the spaces between the multiples of 5 and multiples of 10 and vice versa, but not at them.</p><p>This level also imposes an upper bound on the possible ratio of primes, limiting it to no more than ~20.78% of all natural numbers, and caps the error margin to be the same ratio.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/989/0*y06ojy0Y3MOlgBKd" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=aff628ad76a2" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Reframing the Origin of Prime Numbers & The Sieve Principle]]></title>
            <link>https://medium.com/@ammar.moussa/reframing-the-origin-of-prime-numbers-the-sieve-principle-d9b95157eb45?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/d9b95157eb45</guid>
            <category><![CDATA[number-theory]]></category>
            <category><![CDATA[sieve-of-eratosthenes]]></category>
            <category><![CDATA[mathematics]]></category>
            <category><![CDATA[prime-numbers]]></category>
            <category><![CDATA[sieve]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Fri, 05 Dec 2025 00:50:28 GMT</pubDate>
            <atom:updated>2025-12-05T00:50:28.184Z</atom:updated>
            <content:encoded><![CDATA[<p>Prime numbers have long been regarded as exceptional or special, with many concepts and structures built upon them. However, despite centuries of study, they continue to baffle mathematicians. The number of problems that remain open is staggering and makes you wonder “<strong><em>What is wrong with these primes?! Why are they such troublemakers?!</em></strong>”</p><p>Centuries of unsuccessful attempts to settle these problems suggest that it is not merely that we have not yet found the proper methods and tools to tame them, but that something fundamental is missing. It is valuable to develop new methods derived from our current understanding of prime numbers, but it may also be necessary to pause and ask a critical question: <strong><em>Do we truly and fully grasp the essence of prime numbers?</em></strong></p><p>Is it not possible that we have overlooked some fundamental fact about them? Maybe it is a <strong>basic principle</strong>, so elementary that it could provide the foundation for new insights within existing frameworks.</p><p>Alternatively, perhaps what is missing is not merely a technical detail but an essential truth, potentially even self-evident, yet unrecognized — an <strong>axiom</strong> waiting to be named, whose recognition could resolve many longstanding problems.</p><p>Traditional approaches, rooted in conventional conceptions of prime numbers, are likely limited by an incomplete understanding. A different unorthodox perspective is definitely needed here. “Different” does not necessarily imply rejecting the old one; it does not have to be a binary choice between competing views.</p><p>Different perspectives usually reveal fresh insights from different angles, fostering a more comprehensive understanding by integrating more than one viewpoint — potentially uncovering a core truth at their intersection and providing a deeper overall understanding through their union.</p><p>So, if such a fact exists and it has remained concealed for so long, then by what lens might it be revealed?</p><p>The idea of viewing prime numbers from a <strong>different perspective</strong> can initially be perplexing, as in “<strong><em>Where to begin?</em></strong>”</p><p>To form such a perspective, we need to return to the basics and make careful observations, perhaps even philosophical ones, to identify any overlooked aspects. Actually, I would not even mind questioning the foundations of mathematics itself if I have to in order to get to the bottom of this.</p><p>Anyway, we definitely first need to revisit the conventional definition of prime numbers and return to the foundational question: <strong><em>What are prime numbers, in their essence, and from where do they arise?</em></strong></p><h3>Prime Numbers Are Defined by What They Are Not</h3><p>The standard definition of a prime number — “<strong>a natural number greater than 1 that has no positive divisors other than 1 and itself</strong>” — is notably not self-contained. It defines primes not by an intrinsic property, but by exclusion: by what they lack. Primes are not defined by what they inherently are, but rather by what they are not, which seems strange for something considered foundational.</p><p>A negative definition that results a lack of structure is tolerable and not problematic in many areas, but when the concept in question is foundational — like primes in number theory — it complicates things. If the building blocks are defined only by exclusion, then the structures built on them rest on negation bases that complicate their investigation and generalization.</p><p>Unlike square numbers or factorials (for example), whose structures are internally generated, a prime number’s status emerges only in contrast to the set of all other divisors it does not possess. Formulating a precise definition of primes without relying on explicit or implicit negation is exceptionally difficult if not even impossible due to the lack of structure.</p><p>Even the positive formal definition : <br>“A number p is prime if: ∀𝑑 ∈ ℤ, (𝑑∣𝑝) ⟹ (d=1 or d=p)”<br>does not actually provide a structure. It just obscures the negation and the lack of generative structure.</p><p>This fundamental characteristic has several important implications. This relational definition implies that <strong>primality is not an inherent attribute</strong>, but a conditional one — dependent on the broader numerical context. It suggests that a number is a prime only under a framework of exclusion imposed by human-defined criteria.</p><p>In other words, primes are <strong>not self-defined</strong>; their status is a reflection of complex interactions within the number system. This suggests that being prime <strong>may not be an intrinsic property</strong> of a number but rather an <strong>emergent one</strong>, earned under specific circumstances.</p><p>Indeed, it implies that the set of prime numbers exists precisely because we have established the rules governing their existence and identification, and even more, we chose to work within the domain where they persist. Primes only live within the natural numbers (ℕ), take on a different form within the integers (ℤ), and cease to exist outside of these domains.</p><p>This leads to the intriguing idea that prime numbers may not be as inherently fundamental as we often perceive them to be. While primes act as fundamental building blocks from one perspective, they seem to be <strong>byproducts</strong> of a more foundational numerical structure we have yet to articulate. Their seemingly extraordinary behavior could merely be a consequence of a deeper underlying fact, or even a beneficial byproduct of that fact.</p><h3>Primes Structure Is Not Independent</h3><p>The fact that the set of primes is built upon a chosen, negation-based definition rather than an expression of a generative principle means that their determination is always dependent on external factors or other numbers, rather than being a self-contained fact that can be directly investigated. Because of that, we intuitively consider their behavior emergent and contextual, neither intuitive nor generative, even if this has not been formally articulated; thus, we remain skeptical of patterns that emerge from them, treating those patterns as curiosities rather than clues.</p><p>The definition of primes by negation and our inability to recognize a stable clear structure that expresses their distribution — due to apparent irreducible complexity — lead us to treat prime distribution as pseudo-random. We approach this using statistics and probability and focusing more on asymptotic behavior, rather than trying to solve the puzzle of the lack of a finite structure.</p><p>However, even when we try that, we tend to seek an independent structure of primes because of the inertia of their fundamental role. But the incompleteness of their definition — arising from their dependence on other integers and their failure to provide a structural account of distribution — suggests that fully understanding prime numbers <strong>requires incorporating all other numbers</strong>, as they likely play a crucial role in shaping this distribution.</p><p>That means that the prime distribution could be understood not as an intrinsic mystery but as a shadow cast by deeper interactions among all numbers. Thus, the key to understanding primes may lie <strong>not within the primes</strong> themselves, but in <strong>the unseen dynamics of all numbers</strong>. This is supported by what the sieve of Eratosthenes shows [[1]]. The generative relation between composites and primes is a mutual exchange; primes generate composites by construction, and composites generate primes by abandonment.</p><p>This yields the fact that neither <strong>primality</strong> nor <strong>compositeness</strong> is an intrinsic property of numbers; rather, they are<strong> imposed properties</strong> by a specific multiplicative perspective where primality and compositeness earn meanings within it and can form conceptual structures.</p><p>Prime distribution seems to have a structure, but it is not an independent one. This is what the mutual generative relation between composites and primes dictates.</p><p>That can be clearly concluded not only from the sieve of Eratosthenes, but also from Riemann’s Zeta function [[2]], which is not only about primes, but is frankly about all numbers. Even its generative Euler’s product [[3]]; while it was built based on primes, it actually ends up being about powers of primes, which are clearly composites.</p><p>In other words, the structure of primes is <strong>fused</strong> and <strong>molded</strong> within the structure of all numbers and it is hard to isolate it from that overall structure. Thus, it would be easier to understand the distribution of primes within the context of all numbers rather than in isolation.</p><p>This dependency leads to a flipped scenario in understanding the distribution of primes. As primes form a minority within the context of all numbers, it would be easier to perceive the distribution of primes from the perspective of primes being gaps between composites, rather than the composites seen as gaps between primes, which naturally aligns more with the perspective of seeing primes as byproducts of deeper dynamics.</p><p>This is important in how we should think of prime numbers when we try to understand their distribution more than it is important to be reflected into our mathematical expressions.</p><h3>Primes as a Consequence of Multiplicative Asymmetry</h3><p>These observations suggest, among many other things, that primes are <strong>emergent phenomena</strong> rather than fundamental units. They should be understood as artifacts produced by deeper interactions within the number system — a consequence of systemic dynamics rather than isolated mathematical facts. If we are to make progress, we may need to reframe the question entirely: not “<em>What are primes?</em>” but “<em>What system produces them?</em>” We need to uncover the numerical framework from which their behavior naturally emerges.</p><p>The traditional perspective relies on the idea that prime numbers existed before we defined mathematics, and we merely discovered them, defined mathematical statements about them, and the tools to identify them, such as <strong>the Sieve of Eratosthenes</strong>. A pragmatic perspective would see the prime numbers as simply the result of the definition we chose. That is, we defined a rule to group numbers, and thus any number that belongs to the set that satisfies the rule is called a prime, with the remaining numbers called composites, regardless of which set was created first, leaving the rest to fall into the other. While this perspective is somewhat rigorous and direct, it does not define or even hint at the underlying structure whose existence we feel but fail to articulate.</p><p>Strikingly, a very axiomatic and trivial perspective of how primes do emerge might help us to shed more light here.</p><p>From a different, yet more intuitive, perspective, we would see primes as anomalies that arise from breaking operational symmetry between <strong>multiplication</strong> and <strong>division</strong> within the set of natural numbers by excluding real numbers. That is, for any two natural numbers a, b ∈ ℕ, their product a × b = c remains within ℕ. However, their quotient a ÷ b = c does not necessarily belong to ℕ.</p><p>The symmetry only guaranteed to remain valid in the special cases involving number 1, as every natural number n can be expressed as the product 1 × n, which corresponds to repeated addition of 1 — that is, adding 1 to itself n times. Likewise, dividing any number by 1 gives back the number itself: n ÷ 1 = n. In this sense, every number appears in the multiplication table of 1, and 1 appears in the multiplication tables of all numbers in ℕ. Otherwise, the validity of the symmetry depends on whether the domain we choose to work with would allow it to persist or not.</p><p>That is based on the fact that division is the inverse of multiplication, and it should be its full complement, unless we exclude a portion of the number line as we do when we choose to work within ℕ.</p><p>This asymmetry — where multiplication is closed in ℕ, but division is not — creates a structural irregularity that gives rise to prime numbers. This operational asymmetry is not unique to multiplication. A similar asymmetry exists between <strong>addition</strong> and <strong>subtraction</strong> in the positive integers and in the natural numbers. For any two natural numbers a, b ∈ ℕ, their sum a + b ∈ ℕ, so addition is closed in ℕ. But subtraction is not: a — b ∉ ℕ when a ≤ b. For example, 3–5=-2 ∉ ℕ. Just as this asymmetry gives rise to structural gaps when attempting to decompose numbers using subtraction, the multiplication–division asymmetry creates gaps when building numbers multiplicatively. These gaps — numbers that cannot be constructed as products of smaller natural numbers — are what we identify as <strong>prime numbers</strong>.</p><p>This asymmetry is a direct consequence of how the set of natural numbers ℕ is fundamentally structured. However, this definitional choice is not arbitrary; it establishes a specific arithmetic environment within ℕ that creates a structural irregularity that necessarily gives rise to prime numbers. These irregularities have proven useful and lead to a variety of interesting phenomena, which are inevitable consequences of this broken symmetry.</p><p>Simply, the existence of primes is a <strong>necessary outcome</strong> of the deeper structural property of the natural numbers — the operational asymmetry between multiplication and division. In this sense, primes are not just defined as irreducible — they are <strong>forced into existence</strong> by the incompleteness of multiplicative composition within ℕ.</p><p>This fact is very intuitive and axiomatic that we might think it is absurd to think of it as the deep reason for the existence of the mysterious primes, so we just overlooked it. It simply means that primes are merely <strong>glitches</strong> that emerge inevitably from first principles — not as axioms, but as consequences of operational imbalance, a direct consequence of the broken structural symmetry between multiplication and division, possessing the essential characteristic of being irreducible, unique factors, <strong>exactly because their very glitchy nature</strong>.</p><p>This reframing allows us to see primes neither as merely special numbers discovered through observation, nor as merely structural roles within the natural number system, defined relationally by divisibility and multiplication, <strong>but as the natural and inevitable byproduct of the arithmetic structure itself </strong>— emerging from the fracture line between operations. They are the “homeless numbers” that could not be formed through simple multiplicative combinations within ℕ, due to the fundamental broken symmetry between division and multiplication.</p><p>This aligns with that primes are a direct consequence of the <strong>rules and boundaries</strong> we defined for our system by choosing to work within ℕ, rather than being intrinsic property of the numbers.</p><h3>The Sieve Principle</h3><p>The perspective that prime numbers are a necessary consequence of the operational asymmetry between multiplication and division reveals a key insight: <strong>the sieve nature of primes</strong>. Primes are what remain after all composite numbers are sieved out. The process of identifying prime numbers through a sieve, such as <strong>the Sieve of Eratosthenes</strong>, is more than a computational algorithm; it reflects the very structure of how primes emerge within the natural numbers.</p><p>Primes exist as a result of a continuous, layered process of elimination. Their specific positions on the number line are a direct consequence of this iterative elimination of multiples by preceding numbers. Each composite number eliminates potential prime candidates, and this removal process, being dependent on prior numbers, renders it an accumulative process by nature, and renders the pattern of primes not static but <strong>dynamically evolving</strong>, as numbers are continuously sieved out by each new number. The primality of any given number is contingent upon all smaller numbers failing to divide it. This inherent dynamism and cumulative nature of the sieving process explain the persistent difficulty in formulating simple, direct generative formulas for primes.</p><p>The sieve nature of primes reflects an important fact, which can be called <strong>The Sieve Principle</strong>, defined as follows: <strong>The Sieve of Eratosthenes is not merely a method but an operational manifestation of the very structural rules that define and give rise to prime numbers within</strong> ℕ.</p><p>It is not merely a tool for identifying prime numbers; its process is the structural definition of primality in action, as it embodies the essential logic and mechanism behind their generation (election).</p><p><strong>The Sieve Principle has two fundamental implications</strong>:</p><p>1. The distribution of prime numbers is <strong>structured and dynamic</strong>, not random. Though it may appear irregular or patternless on the surface, it emerges from a precise and <strong>deterministic process</strong> grounded in the structural asymmetry of arithmetic.</p><p>In other words, the observed irregularity or randomness of prime number distribution is not chaotic, but a <strong>deterministic and well-structured</strong> outcome of the sieve process, as every composite number is precisely defined by its factors, ensuring its predictable removal from the set of potential primes. The underlying mechanism is regular, defined, and rule-based.</p><p>2. The behavior of prime number distribution is fully encapsulated in the process of the Sieve of Eratosthenes. Thus, any results or conclusive inferences derived directly from observing and analyzing the process and behavior of the Sieve of Eratosthenes are <strong>inherently self-evident</strong> with respect to prime numbers. Any <strong>inevitable</strong> outcome from the behavior of the Sieve of Eratosthenes is <strong>valid to be declared an axiom if it cannot be driven from the current axioms due to the irreducible complexity</strong>.</p><p>In other words, analyzing the process and behavior of the Sieve of Eratosthenes constitutes the master key to understanding prime number distribution, precisely because it mirrors the operational manifestation of the structural asymmetry that gives rise to and defines prime numbers. Tracing that process carefully may reveal a <strong>hidden pattern</strong>, or explain <strong>why no simple pattern exists</strong>. Such analysis can also identify an average behavior or baseline structure, and sources of interference — along with the mechanisms governing irregularities, whether they are bounded, periodic, or tend to be chaotic.</p><p>To firmly establish the Sieve Principle, it is important to address the perceived exclusivity of the Sieve of Eratosthenes. The validity of this perspective does not hinge on the Sieve of Eratosthenes being the sole algorithm capable of enumerating prime numbers, nor does it diminish the utility of other mathematical tools. Instead, the argument posits that the sieve uniquely encapsulates the definition and structural behavior of primes. Its process reflects the very rules from which prime numbers emerge, making it the most direct conceptual model for understanding their distribution.</p><p>While other methods may identify primes, the sieve is more than a method — it is a manifestation of the structural asymmetry that gives rise to primes.</p><p><strong>It is not about exclusivity in utility, but exclusivity in insight.</strong></p><p>Given the strict mathematical definition of prime numbers, there exists <strong>only one unique set of all primes</strong>. Therefore, any method that correctly identifies <strong>all </strong>primes must produce the same set as the Sieve of Eratosthenes. If a method identifies only a subset, or does so from a specific perspective, that does not reduce the sieve’s role as the <strong>structural generator</strong> of the prime set.</p><p>What matters is not the uniqueness of the Sieve of Eratosthenes as an algorithm, but its profound capacity to reflect and embody the intrinsic rules governing prime number generation and behavior. The inferences from studying the Sieve of Eratosthenes gain their authority precisely because they are drawn from the very mechanism that generates <strong>all and only the prime numbers, and nothing else</strong>. In other words, <strong>the sieve’s behavior is not incidental to the primes; it defines them structurally</strong>. Therefore, any results or inferences drawn directly from analyzing its process and behavior are inherently consistent with the definition of primality.</p><p><strong>In summary</strong>, the Sieve of Eratosthenes is not merely a procedural device but a generative structure that embodies the defining logic of primality. Its behavior is not an artifact of computation but an expression of the intrinsic arithmetic order within ℕ.</p><p><strong>For this reason, the Sieve Principle should be treated as a meta-axiom</strong> — a foundational assertion that the sieve process itself encapsulates the generative logic from which all prime-related structures emerge. Any property that arises inevitably and universally from the sieve’s operation may therefore be regarded as <strong>axiomatically valid within this generative context</strong>, even if not derivable from the standard axioms of number theory.</p><p>In short, prime numbers are not static floating objects. They result from a dynamic process that does produce a static pattern, and that is why we never able to find a closed form to describe their exact distribution.</p><p>[[1]] If you need, you can check <a href="https://mathworld.wolfram.com/SieveofEratosthenes.html">https://mathworld.wolfram.com/SieveofEratosthenes.html</a>, Weisstein, Eric W. “Sieve of Eratosthenes.” From MathWorld — A Wolfram Web Resource, for detailed explanation of the sieve of Eratosthenes</p><p>[[2]] If you need, you can check <a href="https://mathworld.wolfram.com/RiemannZetaFunction.html">https://mathworld.wolfram.com/RiemannZetaFunction.html</a>, Weisstein, Eric W. “Riemann Zeta Function.” From MathWorld — A Wolfram Web Resource, for more details about the Zeta Function.</p><p>[[3]] If you need, you can check <a href="https://mathworld.wolfram.com/EulerProduct.html">https://mathworld.wolfram.com/EulerProduct.html</a>, Weisstein, Eric W. “Euler Product.” From MathWorld — A Wolfram Web Resource, for more details about Euler Product.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=d9b95157eb45" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Dear Mathematicians: We Need to Talk — An Open Letter From a Programmer Who’s Had Enough]]></title>
            <link>https://medium.com/@ammar.moussa/dear-mathematicians-we-need-to-talk-an-open-letter-from-a-programmer-whos-had-enough-13aa3a8dde37?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/13aa3a8dde37</guid>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[humor]]></category>
            <category><![CDATA[math]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[mathematics]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Mon, 27 Oct 2025 02:16:11 GMT</pubDate>
            <atom:updated>2025-10-27T02:16:11.725Z</atom:updated>
            <content:encoded><![CDATA[<h3>Dear Mathematicians: We Need to Talk — An Open Letter From a Programmer Who’s Had Enough</h3><p>Axiom 0 (The Foundational Assumption): This letter is written in the spirit of intellectual provocation and humor. The author acknowledges that some mathematicians are lovely people who do useful work. However, for the purposes of this proof — I mean, rant — we shall proceed under the assumption that hyperbole serves truth. Reader discretion is advised. ∎</p><p>Dear Mathematicians,</p><p>We need to have an honest conversation. And by “conversation,” I mean I’m going to tell you some uncomfortable truths you’ve been avoiding for decades, and you’re going to sit there and take it.</p><p>For too long, you’ve been strutting around claiming that programmers are just the plumbers of the intellectual world — implementing the brilliant theories you hand down from your ivory towers. You’ve convinced everyone (including some programmers, sadly) that without your “rigorous mathematical foundations,” we’d be lost.</p><p>Here’s the truth: You’re mostly full of bullshit. Your field is held together with duct tape and denial, and honestly? We’d be doing just fine — probably better — without you.</p><p>Let me explain. And yes, I have receipts. So many receipts.</p><h3>Your “Rigor” Is a Joke (And We Have Proof)</h3><p>You LOVE to lecture us about rigor, don’t you? “Everything must be proven!” you declare from your tenured positions. “No contradictions allowed!” you say, looking down your noses at us programmers with our messy debugging and trial-and-error approach.</p><p>Cool story. Let’s talk about ⁰⁰.</p><h3>The ⁰⁰ Comedy Special</h3><p>Hey mathematicians, quick question: What does ⁰⁰ equal?</p><p>You: “It’s undefined! Limits give inconsistent results!”</p><p>Also you: “Actually, we define it as 1 in combinatorics because it makes the formulas work nicely.”</p><p>Still you: “But in analysis it’s definitely undefined.”</p><p>You again: “Well, it depends on the context…”</p><p>Us: “Wait, so mathematical truth is… context-dependent? Sounds like you’re making pragmatic engineering decisions based on what’s useful in different situations?”</p><p>You: “HOW DARE YOU. THIS IS SOPHISTICATED MATHEMATICS.”</p><p>😂😂😂</p><p>So when WE choose how to handle edge cases based on practical needs, we’re “sloppy” and “lack rigor.” But when YOU do the exact same thing, it’s “advanced abstract reasoning” and “depends on the mathematical context.”</p><p>This is your first piece of hypocrisy. You claim absolute rigor and perfection, then immediately start making it up as you go — just like everyone else. You’re just more pretentious about it.</p><p>The emperor has no clothes, friends. And we can all see it.</p><h3>You’re Maintaining Legacy Code and Pretending It’s Perfect</h3><p>Here’s a fun fact I bet you don’t bring up at cocktail parties:</p><p>In 1931, Kurt Gödel — one of YOUR OWN — mathematically proved that your entire field is fundamentally broken. His incompleteness theorems showed that any sufficiently complex mathematical system is either:</p><ul><li>Incomplete (there are true things it can’t prove), or</li><li>Inconsistent (it contradicts itself)</li></ul><p>Mathematics literally cannot prove its own consistency. Your foundations are broken, and one of your greatest minds proved it almost 100 years ago.</p><p>So what did you do with this information?</p><h3>Your Options Were:</h3><p>A) Rebuild from scratch with better foundations? Nope.</p><p>B) Acknowledge the limitations and be humble about them? Haha, no.</p><p>C) Slap some patches on it, pretend everything is fine, and keep building on the wobbly foundation while claiming perfection? DING DING DING! 🎰</p><p>You know what this is? This is legacy code maintenance. This is what we programmers do when we inherit a 40-year-old codebase that’s too big to refactor, so we just keep adding patches and praying it doesn’t collapse.</p><p>Except we don’t claim our legacy code is perfect and eternal. We complain about it! We document the technical debt! We WANT to refactor it but can’t because of business constraints!</p><p>You? You maintain a provably incomplete system and act like it’s the foundation of all truth. That’s not rigor. That’s denial.</p><h3>If Programmers Acted Like You:</h3><p>Let me paint you a picture of what it would look like if we adopted your approach:</p><p>1981: “DOS 1.0 is our foundational axiom system! It’s elegant and complete!”</p><p>1985: discovers DOS can’t multitask “No problem! We’ll just add the Multitasking Axiom! It’s consistent with DOS 1.0… probably… let’s not check too hard.”</p><p>1990: discovers memory limitations “Extended Memory Axiom! Still built on sacred DOS 1.0 though. Can’t question the foundations!”</p><p>1995: system is a Frankenstein monster “This is fine. Anyone suggesting we abandon DOS 1.0 is attacking the very foundation of computing!”</p><p>2000: crashes daily “Just add more patches! Backward compatibility is more important than actually working!”</p><p>2025: still running DOS 1.0 with 500 contradictory patches “This is fine. 🔥☕🔥”</p><p>But we DIDN’T do this. When DOS sucked, we built Windows. When Windows sucked, we built Linux. When both sucked for mobile, we built iOS and Android. We iterate. We rebuild. We improve.</p><p>If you were in charge of software development, we’d still be running DOS 1.0.</p><p>Meanwhile, you’re STILL defending ZFC set theory from the 1920s like it’s scripture. Still debating the Axiom of Choice like it’s a religious schism. Still papering over Gödel’s incompleteness like it’s no big deal.</p><p>This isn’t rigor. This is refusing to admit your system failed.</p><h3>The P vs NP Circus: 50 Years of Academic Navel-Gazing</h3><p>Oh man. Oh MAN. We need to talk about P vs NP.</p><p>You’ve been “working on” this problem for over 50 years. There’s a MILLION-DOLLAR PRIZE for solving it. Entire academic careers are built on it. Mountains of papers. Countless conferences.</p><p>Want to know something hilarious? Any programmer with a few months of experience could answer it in five minutes.</p><h3>Your “Deep Problem”:</h3><p>“Can every problem whose solution is quick to verify also be quick to solve?”</p><h3>Our Answer:</h3><p>“Obviously not. Finding a solution is way harder than checking if a solution works. Have you ever written a Sudoku solver versus a Sudoku checker? It’s not even close. Case closed.”</p><h3>Your Response:</h3><p>“BUT CAN YOU PROVE IT???? 🤓👆”</p><p>And then you spend HALF A CENTURY writing papers about it while we’re out here building the actual software that runs civilization.</p><h3>Here’s Why This Is Extra Bullshit:</h3><p>The whole framing around “quick to verify” is intellectually dishonest, and I think deep down you know it.</p><p>SAT Problem:</p><ul><li>✅ Easy to verify: “Does this variable assignment satisfy the formula?”</li><li>❌ Hard to verify: “Does ANY satisfying assignment exist?” ← This is what you actually need to know!</li></ul><p>To verify that NO assignment exists, you’d have to… check all of them. Which is the hard part. Which is the whole dang problem.</p><p>Traveling Salesman:</p><ul><li>✅ Easy to verify: “Is this a valid tour of length 100?”</li><li>❌ Hard to verify: “Is this the SHORTEST possible tour?” ← The actual question!</li></ul><p>To verify optimality, you’d need to check all other tours. Which is… the hard part. Again.</p><p>You can’t verify optimality without searching the entire space, which IS THE PROBLEM YOU’RE TRYING TO SOLVE.</p><p>So your whole P vs NP framework is a shell game. You pretend “verification” is this profound insight, but verification doesn’t actually tell you what you need to know!</p><p>It’s like saying “it’s easy to check if a number is prime, therefore finding large primes should be easy!” That’s… not how it works.</p><p>We know search is hard. We know optimization is hard. We know this from writing actual code that interacts with actual reality.</p><p>Why are you still debating this? Oh right — because you don’t actually build anything, so you can afford to spend 50 years philosophizing about the obvious.</p><p>This is what happens when you let people who don’t write code debate computational problems. You turn self-evident truths into decades-long mental gymnastics.</p><h3>You Don’t Even Understand IF-THEN-ELSE</h3><p>This one genuinely shocked me when I realized it.</p><p>We write:</p><pre>if condition:<br>    handle_true_case()<br>else:<br>    handle_false_case()</pre><p>Complete handling of all possibilities. If we forget the else block, our program crashes. Reality enforces completeness. Users get angry. We learn fast.</p><p>You write:</p><pre>Assume P = NP.<br>[Derive contradiction]<br>Therefore P ≠ NP. QED. ∎</pre><p>Um… where’s the else? You just showed that one assumption leads to a contradiction. That’s just the else case! You didn’t actually construct a proof of P ≠ NP — you just eliminated one possibility.</p><p>You love “proof by contradiction” because it lets you avoid actually constructing the thing you’re trying to prove. You prove something exists without finding it. You prove something is impossible without building an alternative.</p><p>In programming, this doesn’t fly. You can’t just say “a solution exists somewhere” without providing it. You can’t just say “this approach won’t work” without showing what DOES work.</p><p>Your methodology lets you get away with incomplete thinking that would never survive in the real world.</p><p>And yet you have the audacity to call US sloppy! 😂</p><p>We handle ALL cases. You handle whichever case is convenient and call it a day. But sure, lecture us more about rigor.</p><h3>“But What About Everything Mathematics Gave Programming?!”</h3><p>I can hear you sputtering already:</p><p>“What about cryptography! Machine learning! Compression! Graphics! Quantum computing! Google’s PageRank! You NEED math for those!”</p><p>Do we though? Let’s be honest about what actually happened:</p><h3>Cryptography</h3><p>“Oh wow, if you multiply two large primes, it’s really hard to factor them back! We shall call this RSA and claim credit for advanced number theory!”</p><p>You think programmers — people who literally play with numbers for a living — wouldn’t have stumbled onto this? We experiment with data patterns constantly. This isn’t some mystical gift from the mathematical gods. It’s noticing that factoring is harder than multiplying.</p><p>We would have figured this out through experimentation. You just wrote it up formally first.</p><h3>Machine Learning</h3><p>Neural networks WORKED before you had the theory. Backpropagation existed. Gradient descent existed. Things trained and made predictions.</p><p>Then you showed up, formalized it with Greek letters, and took credit for “providing the mathematical foundations.”</p><p>Gradient descent isn’t a profound insight — it’s “walk downhill to find the lowest point.” Any programmer optimizing a function would discover this through trial and error.</p><p>The math came AFTER the working systems, not before.</p><h3>Compression Algorithms</h3><p>“We proved you can’t compress random data beyond its entropy!”</p><p>Yeah, no shit. That’s not a mathematical breakthrough — that’s common sense wrapped in formalism. If you remove redundancy, files get smaller. If there’s no redundancy, they don’t.</p><p>Programmers would figure this out by just… trying to compress things.</p><p>By the way.. even that claim is questionable ;) we have our own ways that you probably would not understand.</p><h3>The Pattern</h3><p>Do you see it? Most of your “contributions” are:</p><ol><li>Programmers build something that works</li><li>You formalize it with Greek letters</li><li>You take credit for the idea</li><li>You lecture us about how we couldn’t have done it without you</li></ol><p>We absolutely could have. And honestly, we probably would have gotten there faster without your gatekeeping.</p><h3>What You Actually Are</h3><p>Let’s strip away the pretension and be real about what “mathematicians” actually are:</p><h3>Category 1: Applied Mathematicians Doing Computational Work</h3><p>You’re literally just programmers who write more Greek letters. You think about algorithms, solve computational problems, and deal with real-world constraints.</p><p>Just call yourselves programmers. That’s what you are. The extra formalism doesn’t make you special — it makes you slower.</p><h3>Category 2: Pure Mathematicians Exploring Abstract Ideas</h3><p>You’re doing intellectual hobby activities. Solving puzzles for fun. Exploring weird edge cases of logic systems for the joy of it.</p><p>This is fine! Hobbies are great! Crossword puzzles are great! Sudoku is great!</p><p>But stop pretending you’re on some profound truth-seeking mission essential to human progress. You’re doing the intellectual equivalent of Sudoku. It might occasionally be useful, but it’s not the foundation of all knowledge.</p><p>So you’re either:</p><ol><li>Programmers in denial, or</li><li>Philosophy hobbyists with a god complex</li></ol><p>Pick one and be honest about it.</p><h3>Real Programmers vs. Your Fantasy Version</h3><p>Let me be clear: I’m not talking about “fast-food programmers” — those people who watched YouTube tutorials and can glue together React components. They’re not the same as real programmers.</p><p>Real programmers — the ones who actually understand systems, think from first principles, and build things that work in messy reality — we don’t need you.</p><p>Real programmers:</p><ul><li>✅ Embrace uncertainty and iterate toward solutions</li><li>✅ Handle ALL cases (if-then-ELSE)</li><li>✅ Rebuild broken systems instead of patching forever</li><li>✅ Prove things work through testing and reality</li><li>✅ Accept bugs as inevitable and debug them</li><li>✅ Learn from failure and adapt quickly</li></ul><p>You:</p><ul><li>❌ Demand impossible perfection before acting</li><li>❌ Only handle convenient cases (if-then, forget the else)</li><li>❌ Cling to provably broken foundations</li><li>❌ “Prove” things that never touch reality</li><li>❌ Refuse to admit when systems fail</li><li>❌ Worship historical figures and resist change</li></ul><p>If you’re doing rigorous problem-solving from first principles, you’re already doing mathematics. You just don’t waste time writing it in Greek letters and submitting it to journals that three people will read.</p><h3>In Conclusion: The Truth You Don’t Want to Hear</h3><p>Here it is. The thing nobody wants to say out loud but everyone knows:</p><p>Programmers don’t need you.</p><p>We figure things out through experimentation, iteration, and building systems that actually work. We handle messy reality. We adapt when things break. We rebuild when necessary.</p><p>You? You debate ⁰⁰ for the hundredth year. You maintain provably incomplete axiom systems because admitting failure would hurt your ego. You spend 50 years on P vs NP when any working programmer could tell you the answer immediately. You claim perfection while your foundations crumble.</p><p>Your field has become what you claim to despise: dogmatic, incomplete, resistant to change, and completely detached from reality.</p><p>The useful parts of mathematics are computational — and we would have figured them out through building real things. The rest is puzzle-solving dressed up as profound wisdom.</p><p>So here’s my suggestion: Either admit you’re programmers with extra formalism, or admit you’re puzzle enthusiasts having fun, or get out of the way and stop gatekeeping rigorous thought.</p><p>We never needed you. We just let you think we did.</p><p>Sincerely,</p><p>A Programmer Who’s Tired of Your Bullshit</p><p>P.S. — If this letter made you mad, you have two options:</p><ol><li>Write a formal proof that I’m wrong (good luck with that provably incomplete axiom system of yours), or</li><li>Admit I have a point and go do something useful</li></ol><p>Your move, mathematicians. 🎤⬇️</p><p>P.P.S. — Yes, I know some of you will try to “well actually” me in the comments. Save it. I’ve been debugging code while you’ve been debating angels on pinheads. I’m not impressed by your Greek letters.</p><p>Now if you’ll excuse me, I have actual problems to solve.</p><p>🔥😂🔥</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=13aa3a8dde37" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[أوقفوا التعاطف مع الجريمة]]></title>
            <link>https://medium.com/@ammar.moussa/%D8%A3%D9%88%D9%82%D9%81%D9%88%D8%A7-%D8%A7%D9%84%D8%AA%D8%B9%D8%A7%D8%B7%D9%81-%D9%85%D8%B9-%D8%A7%D9%84%D8%AC%D8%B1%D9%8A%D9%85%D8%A9-55825bfed285?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/55825bfed285</guid>
            <category><![CDATA[suicide]]></category>
            <category><![CDATA[suicide-prevention]]></category>
            <category><![CDATA[الانتحار]]></category>
            <category><![CDATA[suicide-awareness]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Wed, 14 May 2025 02:59:42 GMT</pubDate>
            <atom:updated>2025-05-14T02:59:42.027Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/640/1*idLea848MF8o1tb-PTiI4A.jpeg" /></figure><p><strong>إن التعاطف التلقائي الذي نبذله مع المنتحرين جزءٌ من المشكلة وليس الحل. فرغم طبيعته الإنسانية، فإنه قد يصبح شرًا كامنًا غير مقصود يدفع البعض نحو الهاوية، خاصة في ظل غياب الدعم النفسي. وهنا نستعرض عدة أسباب رئيسية تجعل التوقف عن التعاطف العلني أو الإعلامي مع المنتحرين وتجريم ذلك ضرورة أخلاقية واجتماعية مُلحة.</strong></p><p><strong>بداية، فإن هذا التعاطف يُغذي الظاهرة، خاصة بين الشباب. فالانتحار قد يبدأ بفكرة عابرة، ثم تتجذر في أذهان من يعانون ضغوطاً نفسية أو اجتماعية عندما يرون المجتمع يمنح المنتحرين تعاطفاً واسعاً. وتخيّل معيَّ شاباً أو فتاة ممن أنهكهم الإحباط أو اليأس أو الوحدة، ثم تأتي تلك القصص الإعلامية أو منشورات وسائل التواصل الاجتماعي التي تصور المنتحر كضحية تستحق الحب. وردة الفعل هنا أن يتخيل المرء أن موته سيمنحه ما افتقده في حياته: الاهتمام، التعاطف، أو حتى “العدالة” الرمزية. إن هذا التصور، وإن بدا غير منطقي، يمكن أن يتحول إلى دافع نفسي قوي يؤدي إلى تبني وجهات نظر مدمرة تغذيها دراما التعاطف المستمر مع المنتحرين، فتستمر في جذب صاحبها نحو القاع إلى أن يصل إلى مرحلة الاستسلام للفكرة، خصوصاً حين لا يتوفر الدعم النفسي المناسب سواء من المختصين أو من المحيطين، وهو أمرٌ في حد ذاته ظاهرة أخرى تتنامى سريعاً في مجتمعنا العربي مع تأثرنا الثقافي والمادي بالفردية والعولمة. وفي هذا الفراغ، يغدو التعاطف العام ملاذاً وهمياً للبعض، حتى لو كان هذا الملاذ يأتي بعد الموت.</strong></p><p><strong>إن استمرارنا في تقديم هذا التعاطف بدلاً من تقديم حلول حقيقية يشبه إلقاء الوقود على نار مشتعلة بالفعل. ناهيك عن أن تكرار المشهد يدفع للتآلف معه وكأنه أمر طبيعي يحدث للبعض ويطرح الفكرة على الطاولة لمن هو في حالة ضعف، وللمراهقين، ولمن لا علم لديهم.</strong></p><p><strong>أما ثانياً، ودعونا هنا نتحدث بصراحة… فالحقيقة الأخلاقية هنا هي أن الانتحار ليس فعلاً محايداً، بل هو اعتداء على الحياة، وسواء كانت تلك حياة الذات أو حياة الآخر فالأمر واحد. إن الانتحار ليس مجرد “خيار شخصي” أو “هروب من الألم”. إنه فعل قتل متعمد، يستهدف الذات بدلاً من الآخر. إن الانتحار هو في حد ذاته جريمة قتل مكتملة الأركان لا تختلف عن أي جريمة قتل يعاقب عليها القانون، إلا أنها لأسباب عملية واضحة تعتبر في حال نجاحها دعوة منقضية بموت الجاني لا وجه لإقامتها، في حين يتجنب القانون صراحة تجريم الشروع فيها ومعاقبة الجاني في حال الفشل لكي لا يكون هناك دافع أكبر للمجرم للحرص على إنجاح جريمته وهو ما تقتضيه روح القانون من الحفاظ على المصلحة العامة.</strong></p><p><strong>فلماذا إذن، نميل إلى التعاطف مع المنتحر بدلاً من إدانة فعله؟ ربما لأننا نشعر بالذنب تجاه معاناته، أو لأننا نرى فيه انعكاسًا لإخفاقاتنا الجماعية. لكن هذا التعاطف يخلق تناقضاً: فإذا كنا نرفض قتل الآخرين مهما كانت الظروف، فلماذا نتقبل قتل الذات؟ إن إعادة التوصيف الواضح للانتحار كجريمة وللتعاطف معه كتحريض على الجريمة يبدو خطوة ضرورية لتغيير النظرة المجتمعية تجاهه، حتى وإن كان هذا التوصيف أخلاقياً لا يستوجب العواقب القانونية لاقتضاء المصلحة العامة ذلك.</strong></p><p><strong>أما الأمر الثالث وهو الأكثر إثارة للقلق، هو وجود اتجاهات تبدو متعمدة لنشر فكرة الانتحار بشكل غير مباشر. فبين الحين والآخر تنطلق فجأة ما تشبه الحملات الإعلامية المنظمة أو حتى منشورات على وسائل التواصل الاجتماعي تتحدث عن “معاناة المنتحر” بطريقة تجعل منه بطلاً لمأساة ما تُسبغ عليه من وراء ستار هالة البطولة والاستشهاد الزائف، وترسم بشكل غير مباشر صورة رومانسية أو تراجيدية أو إلهامية أو كل ذلك سوياً. ورغم أن بعض هذه الحملات قد تكون مدفوعة بنوايا حسنة إلا أنها غالباً ما تتجاهل جوهر المشكلة وأن الانتحار ليس حلاً، ولا مُبرراً، مهما كانت الظروف. بل إن بعض الأيادي أحياناً تستثير حملات التعاطف الدرامي تلك للترويج لفكرة الانتحار دون تقديم حلول حقيقية وذلك تحت مبررات إنسانية قد تكون صحيحة في ذاتها إلا أنها أولاً لا تعد مبرراً لارتكاب تلك الجريمة وثانياً أنها تُستغل فقط كغطاء للترويج غير المباشر لفكرة الانتحار دون أدنى محاولة حقيقية على أرض الواقع للتعاطي مع هذه المبررات أو إيجاد حلول لها لو صدق أصحابها.</strong></p><p><strong>وليس عنا ببعيد خطاب بعض المنظمات أو الأفراد المدافع بشراسة عن الهراء المسمى “الحرية في الموت” أو “حق الفرد في اختيار نهايته”، مستغلين قضايا مثل الفقر أو الاضطهاد أو المرض كمبررات. لكن، أين هي محاولاتهم لمعالجة هذه القضايا؟ إن التركيز على التعاطف مع المنتحرين والدفاع عنهم وتقديم المبررات لهم بدلاً من حل المشكلات التي أدت إلى يأسهم هو نوع من التلاعب الخفي الذي يستحق أقصى درجات العقوبة الجنائية. فحتى المرض النفسي ليس مبرراً للانتحار أو مسوغاً له أو مخففاً من ذنبه، والاستثناء الوحيد هنا هو حالة الجنون التي لا يسأل صاحبها عن أفعاله أصلاً لا في الدنيا ولا في الآخرة.</strong></p><p><strong>وهنا وقبل أن أختم لابد من الإشارة أيضاً لجانب آخر للمشكلة، وهو أولئك الذين يُنصبون أنفسهم وكلاء للرحمة أو العذاب ويوزعون صكوك الغفران أو اللعنة على هذا أو ذاك، ولهؤلاء نقول نحن لا يعنينا الحكم على شخص ما بعينه، فكلٌ مقابلٌ ربَّه وواقف بين يديه وهو أعلم به أيا كان عمله، إن ما يعنينا هنا هو رفض الفعل والجريمة نفسها ونقدها وربطها بكل أشكال المفاهيم السلبية التي تنطبق عليه فعلاً ومنها الجبن والضعف والقنوط من رحمة الله. إن ذلك وحده الكفيل ببناء ذلك الحاجز السميك في الأذهان الذي يمنع المرأ من التفكير أصلاً في الأمر ناهيك عن التخطيط له أو الإقدام عليه، مثله كمثل أي جريمة، وذلك دون الخوض في سيرة أفراد بعينهم لا بالحسن ولا بالسوء.</strong></p><p><strong>إن الخلاصة هنا هي أننا بحاجة لأن نتوجه نحو موقف أكثر مسؤولية. فالتوقف عن التعاطف مع المنتحرين لا يعني التخلي عن الإنسانية، بل هو دعوة لتحمل المسؤولية تجاه الحياة. فبدلاً من تقديم التعاطف كمكافأة رمزية لمن يختارون الموت، يجب أن نركز على بناء مجتمعات تدعم الحياة: عيادات نفسية متاحة، حملات توعية حقيقية، وثقافة ترفض تبرير الانتحار مهما كانت الظروف. إن تغيير نظرتنا للانتحار من “مأساة تستحق الدموع” إلى “جريمة تستحق المواجهة” هو في الغالب الخطوة الأولى نحو عالم عربي بلا انتحار.</strong></p><p><strong>وأخيراً… كلمةٌ لكل من تراوده الفكرة لأي سبب كان… لا تقنط من رحمة الله… لا تستسلم ولا تيأس ولا تكن جباناً، والله يغير من حال إلى حال في غمضة عين… وتذكر أنه حتى الشرك بالله يمكن أن تتوب منه مالم تبلغ الروح الحلقوم، أما الانتحار فهو الذنب الوحيد الذي لا يسعك التوبة منه بعد الإقدام عليه، فأنت حينها من تغلق باب الرحمة على نفسك بيديك.</strong></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=55825bfed285" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Short Message to António Guterres]]></title>
            <link>https://medium.com/@ammar.moussa/short-message-to-ant%C3%B3nio-guterres-15bb06c77c39?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/15bb06c77c39</guid>
            <category><![CDATA[gaza]]></category>
            <category><![CDATA[gazaunderattack]]></category>
            <category><![CDATA[gaza-strip]]></category>
            <category><![CDATA[gaza-genocide]]></category>
            <category><![CDATA[gaza-war]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Fri, 25 Oct 2024 00:25:32 GMT</pubDate>
            <atom:updated>2024-10-25T00:25:32.472Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/800/1*dDb_BSdIiaIMDD18ACaE7g.png" /><figcaption>Photo Source: <a href="https://audiovisual.ec.europa.eu/en/photo/P-060701~2F00-07">https://audiovisual.ec.europa.eu/en/photo/P-060701~2F00-07</a> , European Commission (Christophe Licoppe)</figcaption></figure><p>Dear Mr. António Guterres</p><p>Enough is Enough… What happens in North Gaza now is not different from what happened in Bosnia in July 1995 “The Srebrenica massacre”… I’m not requesting a ceasefire anymore… I demand immediate international military action and air strikes against Israeli Forces in Gaza under section 7 of <a href="https://www.linkedin.com/company/united-nations/">United Nations</a> charter.</p><p>Enough cowardness… Let’s say what should be said from the early beginning.</p><p>Mr. secretary general, we are not afraid anymore of saying what we should said long time ago, and by sending you this message, I’m actually calling everyone and every celebrity around the world to show real bravery and raise their voices and demand what is necessary to be done to save the life of hundreds and hundreds of thousands of innocent men, women and children after your organisation has failed its basic and simple duty of keeping peace and protect the oppressed innocents .</p><p>Condemning, boycotting, and all of these kinds of tamed sanctions is not enough anymore… IDF now are doing criminal atrocities exactly like the Serbian did in Srebrenica. It’s time for the international community to take serious military action against IDF.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=15bb06c77c39" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Personal Change is a Sinusoidal Function over a Slope]]></title>
            <link>https://medium.com/@ammar.moussa/personal-change-is-a-sinusoidal-function-over-a-slope-fea30467dc36?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/fea30467dc36</guid>
            <category><![CDATA[change-management]]></category>
            <category><![CDATA[personal-growth]]></category>
            <category><![CDATA[personal-change]]></category>
            <category><![CDATA[change]]></category>
            <category><![CDATA[persoanl-development]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Thu, 24 Oct 2024 07:41:41 GMT</pubDate>
            <atom:updated>2024-10-24T07:41:41.733Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/640/1*vdQq9p0uh8nh5hiQXxUhAg.jpeg" /></figure><p>We usually think of personal change as a one-step process: you start it, you do it, and then you get the desired results. Unfortunately, that is not true in most cases. One way or another, personal change is a <strong>gradual</strong> process that happens over many rounds and steps.</p><p>If we correctly manage the process, we will take one more step toward the desired results in each new round. Usually, each new round brings better results, and we become, with time, more capable of achieving more things with less effort. Also, we earn more knowledge, wisdom, and experience on how to deal with the subject of change.</p><p>In some exceptional cases, the change can happen in a single step with an immediate effect. We call that <strong>the revolutionary</strong> way of change. Flip it all over, take exceptional decisions, make exceptional procedures, and apply the required change immediately. Although this choice is tempting, and sometimes it is available and gives fast results in the beginning, but only in a few cases the results will become permanent. Relying on the revolutionary approach only to achieve permanent results would require extreme force to eliminate the fierce resistance that will occur sooner or later.</p><p>In most cases, it does not work. A counter-wise flip happens, and the old situation or even a worse one becomes the net result. The typical scenario is that more revolutions will happen, followed by counter-wise flips again and again, and so on. There will be no stability for a long time. So, somehow, if the desired change is going to occur this way, then eventually it will be gradual but with a lot of struggles.</p><p>This approach could be useful in some exceptional situations, as it is like throwing a stone into a stagnant lake where any kind of change is required to break a deadlock situation. Otherwise, this choice should only be used to achieve permanent results in cases where immediate results are necessary to prevent serious damage. In such a case, you should be prepared for the extreme power consumption required to enforce the new situation for a sufficient duration to make it permanent.</p><p>Personal change is a complicated process, and it is more complicated than other kinds of change. The complexity comes from different sides: the nature of the process is dynamic, which requires a lot of effort to follow and guide it all the time. The process also includes altering human behaviors and habits, which is a process that cannot be described as a binary one where an on/off mechanism is applicable in most cases.</p><p>Successful personal change is simply a personal development process, so if you made a development, then you made a positive change. The results of a development process cannot be described using words such as “Success” or “Fail” only.</p><p>Development is a process of multilevel success, and each step in the right direction is a success in itself that deserves the effort.</p><p>The fact is that the change process needs wisdom, patience, and that is why another approach that is more explicit in its gradualism is the preferred one in most cases, as it is safer, easier, and costs less; and it produces results that are more permanent in the long run. However, this takes much longer time to be effective, and it needs some understanding of the real way it works.</p><blockquote>To make a successful change, you should start from where you are, not from where you should be. Change is like a ladder; if you want to reach up, then you should start from where you are. You cannot simply start from the top and ignore the ladder, why? It is because you are not there yet! You are already still at the bottom and need to spend energy to climb up.</blockquote><p>Although this is so obvious and axiomatic, it is strange how much we forget it when we are about to commit a change in our life.</p><p>Sometimes, it might be useful to mix or combine the revolutionary and the gradual approaches together.</p><p>Where the gradual approach is the main context here, the revolutionary approach is used to achieve minor sub-changes more quickly at some stages of the process. However, you must understand that gradual personal change has an oscillatory nature, which is a general characteristic of change processes, but is especially true when it comes to changing human behavior.</p><p>Many people think that gradual guided changes happen in a linear way, where we become either better or worse directly with each step we make; and if they try to draw their path of change to both good or bad, they will draw it as straight lines like the ones shown below. But that is not what actually happens.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/547/1*GBKQxWSq5Fzs19u4fjfx-w.jpeg" /></figure><p>Although the process of the change is too complicated here, we can summarize it in a simple way that can be true in general and enough for you to understand the point.</p><p>Any guided change takes an oscillating or a sinusoidal form. When we attempt to commit a change, we keep trying to rise up until we reach our best. Then, we start falling slowly again until we go back to the initial (or the average) level. After that, we keep falling down until we approach our worst case. When we are near to that worst point, the alarm rings. We wake up and try to raise ourselves up again, and so on. We just circle around an axis, and the net result of such a change is zero. In the long run, our average level remains the same, and that is why most of the guided personal change processes fail.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/587/1*EEfnDWrhz1yB0EprlLbVUw.jpeg" /></figure><p>Of course, the alarms could ring a little earlier, i.e., before reaching the worst point, or we might start to drop before we reach the peak of our best, but in both cases, we will remain cycling around that axis.</p><p>For simplicity and the goals of this illustration, we will ignore such cases and consider the general case, as the conclusions will remain valid for most cases. Also, we will consider only the positive change, as it is what interests us here.</p><p>So, what is wrong here?</p><p>The problem is in the axis we are cycling around, it is a perfectly horizontal one. In order to make a successful change, we should perform a little upward rotation of that axis around which we circle. Such a rotation should neither be a very small one, as the process will take a very long time in this case, nor a too wide rotation, as the slope will become so hard to climb in such a case; our momentum power might not be enough for that.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/525/1*i0PtA7mEw1l5AfQ4uXBauA.jpeg" /></figure><p>The actual practical step to rotate the axis upward is to try to make your <strong>worst level now</strong> just a little better than what your <strong>worst one was before</strong>, and rise up your <strong>best level now</strong> just a little higher than your <strong>last best level was</strong>, and keep on that way. With time, the worst level you will drop to becomes higher than some previous best levels, as you can see in the figure from comparing points <strong>A</strong> and <strong>D</strong>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/541/1*8CkgNzmL0yrnI15185W2RA.jpeg" /></figure><p>Here, it is worth noting that the frequency of circling around the sloped axis would decrease automatically with time as we gain more stability, and the period of the new cycles would increase gradually. Each time, we would need a longer period to fall or rise up again. Later, the period needed to rise up gets shorter, and the time we need to fall becomes longer. The difference between our best level and our worst one in each new cycle would decrease over time. The vertical distance that we travel between the worst and the best levels becomes shorter as we move along the axis, as you can see from comparing the vertical distance between points <strong>C</strong> and <strong>D</strong> with the vertical distance between <strong>E</strong> and <strong>F</strong>.</p><p>When that vertical distance becomes very short and the frequency becomes so slow, the change becomes permanent, and we can say that the overall process succeeded. The overall enhancement will be the vertical distance between the points on the sloped axis and their matches on the horizontal one. That enhancement is the change that happened (the net result of the change process).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/609/1*jfduZCj_zcl1g5QWpCwCYw.jpeg" /></figure><blockquote>A general conclusion here is that behavioral change will not happen successfully once its button is turned on!</blockquote><p>Trying to jump to success and thinking that change is just a switch button is just a delusion; that delusion would take us to certain failure in most cases.</p><p><strong>Changes and enhancements in human behavior happen in an oscillating manner, not a linear one</strong>. You should keep that in mind and respect that oscillating pattern when you try to make a change or enhance your behavior, even if you intend to make a revolutionary attempt at some point.</p><p>Moreover, unless it happened accidentally, you should never try to use the revolutionary approach of change to make major deep changes in yourself because a change in such a way could crack your emotional and mental stability and cause serious damage to your intellectual infrastructure in the long run.</p><p>Deep here means specifically your freedom, your identity, and your basics, including basic beliefs, ethics, and intellectual orientations. This group of elements defines your mental and behavioral orientations. A sudden deep change in them can simply shake your whole personal world.</p><p>Again, one exception is when it is obvious that you are heading toward a disastrous result or serious damage, and a deep change is required immediately to prevent that.</p><p>However, if such a revolutionary deep change happened accidentally for one reason or another, you should be careful because that will lead you, at some point, to be an extremist or a fanatic in some way or another. You should be aware of that and do your best to neutralize such effects, which in turn will require a huge effort. You should treat yourself in such a case as a patient who is in recovery after a major serious surgery. Actually, that is a precise metaphor for what happens, except that it takes a mental and emotional form rather than a physical one.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=fea30467dc36" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[التغيير الشخصي دالة جيبية بمحور مائل]]></title>
            <link>https://medium.com/@ammar.moussa/%D8%A7%D9%84%D8%AA%D8%BA%D9%8A%D9%8A%D8%B1-%D8%A7%D9%84%D8%B4%D8%AE%D8%B5%D9%8A-%D8%AF%D8%A7%D9%84%D8%A9-%D8%AC%D9%8A%D8%A8%D9%8A%D8%A9-%D8%A8%D9%85%D8%AD%D9%88%D8%B1-%D9%85%D8%A7%D8%A6%D9%84-aa1c4e4e5d27?source=rss-fab4b2a1ea7f------2</link>
            <guid isPermaLink="false">https://medium.com/p/aa1c4e4e5d27</guid>
            <category><![CDATA[تنمية-ذاتية]]></category>
            <category><![CDATA[التغيير]]></category>
            <category><![CDATA[إدارة-التغيير]]></category>
            <category><![CDATA[تنمية-بشرية]]></category>
            <category><![CDATA[تطوير-الذات]]></category>
            <dc:creator><![CDATA[Ammar Moussa]]></dc:creator>
            <pubDate>Thu, 24 Oct 2024 07:40:22 GMT</pubDate>
            <atom:updated>2024-10-24T07:40:22.433Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/640/1*PBGAxH5cCkGK0UnRt2miKg.jpeg" /></figure><p>عادة ما نفكر في التغيير الشخصي كعملية من خطوة واحدة: تبدأ به، ثم تفعله، ثم تحصل على النتائج المرجوة. لسوء الحظ، هذا ليس صحيحاً في معظم الحالات.</p><p>بطريقة أو بأخرى، فإن التغيير الشخصي هو عملية <strong>تدريجية</strong> تحدث عبر العديد من الجولات والخطوات. وإذا قمنا بإدارة العملية بشكل صحيح، فسنقوم بخطوة أخرى نحو النتائج المرجوة في كل جولة. ففي كل جولة جديدة، نحصل على نتائج أفضل، ونصبح أكثر قدرة على تحقيق المزيد من الأشياء بجهد أقل، ونكتسب المزيد من المعرفة والحكمة.</p><p>كالعادة، هناك حالات شاذة تؤكد القاعدة. فهناك بعض الحالات التي يحدث فيها التغيير في خطوة واحدة ذات تأثير فوري. ونسمي ذلك بالطريقة <strong>الثورية</strong> للتغيير. اقلب كل شيء واتخذ قرارات استثنائية واتخذ إجراءات استثنائية وقم بالتغيير المطلوب على الفور. بالرغم من أن هذا الاختيار مغري، وأحياناً قد يكون متاحاً ويعطي نتائج سريعة في البداية، إلا أنه من النادر أن تصبح النتائج دائمة. إن الاعتماد على النهج الثوري للحصول على نتائج دائمة سيحتاج إلى استخدام القوة القصوى للقضاء على المقاومة الشرسة التي ستحدث عاجلاً أو آجلاً.</p><p>في معظم الحالات، لا ينجح ذلك ويحدث انقلاب معاكس، ويصبح الوضع القديم أو حتى أسوأ من ذلك هو النتيجة النهائية. إن السيناريو المعتاد هنا هو أن المزيد من الثورات ستحدث تليها تقلبات معاكسة مراراً وتكراراً وهكذا دواليك، ولن يكون هناك استقرار لفترة طويلة. لذا، بطريقة ما، إذا كان التغيير المطلوب سيحدث بهذه الطريقة، فسيكون تدريجياً في النهاية ولكن مع الكثير من الصعوبات.</p><p>قد يكون هذا النهج مفيداً في بعض المواقف الاستثنائية ليكون نوعاً من رمي حجر في البحيرة الراكدة حيث يلزم أي نوع من التغيير لكسر حالة جمود. خلافاً لذلك، يجب استخدام هذا الخيار فقط للحصول على نتائج دائمة في تلك الحالات التي يلزم فيها الحصول على نتائج فورية لمنع حدوث أضرار جسيمة، ويجب أن تكون مستعداً للاستهلاك المفرط للطاقة اللازمة لفرض الوضع الجديد لفترة كافية لجعله دائماً.</p><p>إن التغيير الشخصي عملية معقدة، وهي أكثر تعقيداً من أنواع التغيير الأخرى. يأتي التعقيد من جوانب مختلفة: فطبيعة العملية أنها ديناميكية، وتحتاج إلى الكثير من الجهود للمتابعة والتوجيه طوال الوقت؛ تتضمن العملية أيضاً تغيير السلوكيات والعادات البشرية، وهي عملية لا يمكن وصفها بأنها عملية ثنائية حيث تكون آلية التشغيل والإيقاف قابلة للتطبيق بصورة مباشرة.</p><p>إن التغيير الشخصي الناجح هو ببساطة عملية تطوير شخصية، لذلك إذا قمت بإحداث تطوير، فأنت قد قمت بإجراء تغيير إيجابي. وكما أسلفنا…لا يمكن وصف نتائج عملية التطوير فقط باستخدام كلمات مثل “نجاح” أو “فشل”. التطوير عملية النجاح فيها متعدد المستويات، وكل خطوة نحو الاتجاه الصحيح هي نجاح في حد ذاته يستحق الجهد.</p><p>إن الحقيقة هي أن عملية التغيير الشخصي تحتاج إلى الحكمة والصبر والقدرة على التحكم في العملية برمتها، وهذا هو السبب في أن النهج التدريجي هو النهج المفضل في معظم الحالات لأنه أكثر أماناً وأسهل وأقل تكلفة؛ ويعطي نتائج أكثر ديمومة على المدى الطويل. ومع ذلك، فإنه يستغرق وقتاً أطول ونحتاج إلى بعض الفهم للطريقة الحقيقية التي يعمل بها.</p><blockquote>فلإجراء تغيير تدريجي ناجح، يجب أن تبدأ من حيث أنت، وليس من المكان الذي يجب أن تكون فيه.. إن التغيير مثل السلم.. وإذا كنت تريد الوصول، فعليك أن تبدأ من حيث أنت، ولا يمكنك ببساطة أن تبدأ من الأعلى وتتجاهل السلم لأنك لم تصل بعد ولا تزال بالفعل في القاع وتحتاج إلى بذل الطاقة من أجل الصعود.</blockquote><p>وعلى الرغم من أن هذا أمر بديهي وواضح، إلا أنه من الغريب كيف ننسى ذلك عندما نكون على وشك إحداث تغيير في حياتنا.</p><p>في بعض الأحيان، قد يكون من المفيد مزج النهج الثوري مع النهج التدريجي، حيث يكون النهج التدريجي هنا هو السياق الرئيسي، ويتم استخدام النهج الثوري لإنجاز تغييرات فرعية طفيفة بشكل أسرع في بعض مراحل العملية. ومع ذلك، يجب أن تفهم أن التغيير الشخصي التدريجي له طبيعة متذبذبة، وهي طبيعة عامة لعمليات التغيير، ولكنها صحيحة بشكل خاص عندما يتعلق الأمر بتغيير السلوك البشري.</p><p>يعتقد الكثير من الناس أن التغييرات التدريجية المُوجهة تحدث بطريقة خطية، حيث نصبح إما أفضل أو أسوأ مباشرة مع كل خطوة نتخذها؛ وإذا حاول أحدهم رسم مسارات التغيير إلى الأفضل أو الأسوأ فسيرسمها كخطوط مستقيم مثل تلك الموضحة أدناه.. لكن هذا ليس ما يحدث بالفعل.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/547/1*-xdRVnfKtHVeHSzfNnZ9hQ.jpeg" /></figure><p>وعلى الرغم من أن عملية التغيير معقدة للغاية هنا، إلا أنه يمكننا تلخيصها بطريقة بسيطة يمكن أن تكون صحيحة بشكل عام وكافية لفهم المغزى هنا.</p><p>إن أي تغيير موجه يتخذ شكل دالة جيبية. فعندما نحاول إجراء تغيير، نستمر في محاولة النهوض حتى نصل إلى أفضل ما لدينا، ثم نبدأ في الانخفاض ببطء مرة أخرى حتى نعود إلى مستوى البداية أو المستوى المتوسط، ثم نستمر في الانخفاض حتى نقترب من أسوأ حالاتنا. عندما نكون بالقرب من تلك النقطة الأسوأ، ينطلق المنبه، نستيقظ ونحاول رفع أنفسنا مرة أخرى وهلم جراً. إننا فقط ندور حول محور، والنتيجة الصافية لهذا التغيير هي صفر على المدى الطويل، إذ يظل متوسط المستوى لدينا كما هو، ولهذا السبب تفشل معظم عمليات التغيير الشخصي المُوجَّهة.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/570/1*H1fz0FVNu4_8BPTy0P7Qmg.jpeg" /></figure><p>بالطبع يمكن أن تنطلق الإنذارات قبل أن تصل إلى أسوأ نقطة بقليل، أو قد نبدأ في الانخفاض قبل أن نصل إلى ذروة أفضل ما لدينا، ولكن في كلتا الحالتين، سنبقى ندور حول هذا المحور.</p><p>من أجل التبسيط وتحقيق أهداف هذا العرض، سنتجاهل مثل هذه الحالات وننظر في الحالة العامة، حيث ستبقى الاستنتاجات صالحة لمعظم الحالات. أيضاً، سنركز فقط على التغيير الإيجابي لأنه ما يهمنا هنا.</p><p>إذن، أين هو الخطأ في ما سبق؟</p><p>المشكلة تكمن في المحور الذي ندور حوله، فهو محور أفقي تمامًا. من أجل إجراء تغيير ناجح، يجب أن نُدير المحور الذي ندور حوله قليلاً إلى أعلى، لا يجب أن يكون ذلك الدوران صغير جداً ولا كبيراً. فإذا كانت زاوية الدوران صغيرة جداً، فستستغرق العملية وقتاً طويلاً جداً، وإذا كانت كبيرة، فسيصبح من الصعب جداً تسلق المنحدر، وربما لن تكون قوة العزم لدينا كافية لذلك.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/525/1*bcLYOVaIr8wzn9LhWh7NDQ.jpeg" /></figure><p>الخطوة العملية الفعلية لتدوير المحور إلى الأعلى هي أن تحاول دائماً جعل <strong>أسوأ مستوى لديك الآن</strong> أفضل قليلاً مما كان عليه من قبل، وأن ترفع <strong>أفضل مستوى لديك الآن</strong> أعلى قليلاً مما كان عليه أ<strong>فضل مستوى لك من قبل</strong>. هذه في الواقع هي الخطوة العملية التي تقوم بها لتدوير المحور لأعلى… وبمرور الوقت، سيصبح القاع الذي تهبط إليه أعلى من ذروة سابقة كما ترى من مقارنة النقطتين (<strong>أ</strong>) وَ (<strong>د</strong>).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/572/1*m9Nf1PSMG-ZQfhm5E7DzQg.jpeg" /></figure><p>من الأمور التي يجدر بنا ملاحظتها هنا هي تناقص تواتر الدوران حول المحور المائل تلقائياً بمرور الوقت حيث نكتسب مزيداً من الاستقرار، وتزداد فترة الدورات الجديدة تدريجياً. ففي كل مرة سنحتاج إلى فترة أطول للسقوط أو الصعود مرة أخرى. في وقت لاحق، تصبح الفترة اللازمة للنهوض أقصر، والوقت الذي نحتاجه للسقوط سيصبح أطول. وسيقل الفرق بين أفضل مستوى وأسوأ مستوى لدينا في كل دورة جديدة بمرور الوقت. إن المسافة العمودية التي نقطعها بين الأسوأ والأفضل تصبح أقصر كلما تحركنا على طول المحور المائل، كما ترى من مقارنة المسافة العمودية بين النقطتين (<strong>أ</strong>) وَ (<strong>ب</strong>) مع المسافة العمودية بين (<strong>هـ</strong>) وَ (<strong>و</strong>).</p><p>عندما تصبح تلك المسافة العمودية قصيرة جداً، ويصبح التردد بطيئاً جداً، يصبح التغيير دائماً، ويمكننا القول إن العملية ككل قد نجحت… حينها سيكون التحسن الإجمالي هو المسافة العمودية بين النقاط على المحور المائل ونظيراتها على المحور الأفقي، وهذا التحسن هو التغيير الذي حدث.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/612/1*ebK_GVQ37Q5E7rP-_h4uog.jpeg" /></figure><blockquote>إن الاستنتاج العام هنا هو أن التغيير السلوكي لن يحدث بنجاح بمجرد تشغيل الزر!</blockquote><p>إن محاولة القفز إلى النجاح والتفكير في أن التغيير مجرد زر هو وهم يقودنا إلى فشل مؤكد في معظم الحالات. <strong>إن التغييرات والتحسينات في السلوك البشري تحدث بطريقة متذبذبة وليست خطية</strong>؛ ويجب أن تضع ذلك في اعتبارك وأن تحترم هذا النمط الجيبي عندما تحاول إجراء تغيير أو تحسين في سلوكك حتى وإن كانت لديك النية للقيام بتغيير ثوري في نقطة ما.</p><p>هناك شيء آخر لأضيفه هنا… فما لم يحدث ذلك عَرضاً، فيجب ألا تحاول أبداً استخدام النهج الثوري للتغيير لإجراء تغييرات عميقة كبيرة في نفسك لأن تغييراً بهذه الطريقة يمكن أن يكسر استقرارك العاطفي والعقلي ويسبب أضراراً جسيمة في حياتك وبنيتك الفكرية على المدى الطويل…</p><p>تعني كلمة عميق هنا على وجه التحديد حريتك وهويتك وأساسياتك بما في ذلك المعتقدات الأساسية والأخلاق والتوجهات الفكرية؛ تحدد هذه المجموعة من العناصر توجهاتك العقلية والسلوكية؛ يمكن للتغيير العميق المفاجئ فيها أن يهز ببساطة عالمك الشخصي بالكامل.</p><p>مرة أخرى، هناك استثناء واحد وهو عندما يكون من الواضح أنك تتجه نحو نتيجة كارثية أو ضرر جسيم، ويتطلب الأمر إجراء تغيير عميق على الفور لمنع ذلك.</p><p>ومع ذلك، فإذا حدث مثل هذا التغيير الثوري العميق دون قصد، فيجب أن تكون حريصاً لأن ذلك سيقودك في مرحلة ما إلى أن تكون متطرفاً أو متعصباً بطريقة أو بأخرى؛ يجب أن تكون على دراية بذلك وأن تبذل قصارى جهدك لتحييد هذه الآثار، وهو ما سيحتاج بدوره إلى جهد كبير. يجب أن تعامل نفسك في مثل هذه الحالة كمريض يتعافى بعد عملية جراحية كبرى وخطيرة. في الواقع، فإن هذه استعارة دقيقة لما يحدث، باستثناء أن ذلك يتخذ شكلاً عقلياً وعاطفياً بدلاً من أن يكون جسدياً.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=aa1c4e4e5d27" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>