Skip to main content

Joseph Shunia's Blog

Category: discoveries

0 Comments

Those primes and omega

On the 31st of October 2024, Mihai Prunescu gave a talk at the Logic Seminar in Bucharest presenting the results of our recent collaboration. This talk was entitled: “Primes Resurrection on Halloween”. Our collaboration pertains to an arithmetic term approach to the prime numbers. In the spirit of Halloween, I will leave it somewhat mysterious […]

josephshunia
Published on November 7, 2024
Read More
0 Comments

On the n-th decimal digit of pi

Define the integer-valued function to return the -th decimal digit of . This is the sequence A000796 in the OEIS. We will now state a conjecture that is inspired by a limit appearing in an elementary proof of Stirling’s approximation by Jakub Smolík [1]. In his proof, Smolík shows:     Conjecture. Let such that […]

josephshunia
Last modified on October 23, 2024
Read More
0 Comments

An Easy Formula for Prime Numbers

A current research goal of mine is to find an elementary formula (arithmetic term) for the -th prime number. Today, I can at least report some partial progress. To provide some initial context: An arithmetic term is defined as an expression which uses only the elementary arithmetic operations: (*). (*) For a precise definition, please […]

josephshunia
Published on August 10, 2024
Read More
0 Comments

Formulas for Euler’s Totient Function

I wish to share some intriguing formulas that I have recently discovered for Euler’s totient function, denoted as . Formulas I claim that these formulas are proved, though I omit the details for now. The formulas and their proofs will soon be added to a recent paper of mine: Elementary Formulas for Greatest Common Divisors […]

josephshunia
Published on July 6, 2024
Read More
0 Comments

Multivariate Binary Representation

In this blog post, I introduce Multivariate Binary Representation: A method for encoding the binary expansions of integers as multivariate monomials using a polynomial quotient ring. This encoding process involves modular exponentiation within a specific ring structure, referred to as , to uniquely represent any positive integer . Let . Consider the recursive polynomial quotient […]

josephshunia
Published on May 22, 2024
Read More