r/numbertheory • • Aug 18 '25

Root of 11.111… is 3.333…

1.1k Upvotes

New to this sub, was just mingling with numbers when i stumbled upon this, nothing ground breaking, but its just fun to know that multiplying 3.333…. with itself (3.333…)2 is 11.111…. Just amazed to see that square root of something like 11.111.. is 3.33… 😄 We always associate 3 with 9s, rarely with 1s

(For proof: 3.33…*3.33… = 10/3*10/3 = 100/9 = 11.11…)


r/numbertheory • • Oct 07 '21

I think the definition of prime numbers are wrong

516 Upvotes

I feel that the definition of prime numbers is wrong but because we are so use to thinking in base 10 it might just influence the way we think of primes. So I’d like to argue that 2 is not a prime number because it’s too small. The question is now to make 2 artificially larger by picking a base smaller then the number in question. Using a base I believe of .5 would be sufficient enough to make 2 large enough to show that 2 indeed is not a prime number

I also believe 3 to be too small so I think the first prime number should be 5


r/numbertheory • • Mar 17 '26

Two uncomputable numbers which we know the digits of

Post image
374 Upvotes

Quickly wrote this up in a google doc. I don't actually have any proof these sums converge, but the terms get so small so fast I think it's pretty reasonable to conjecture they do, and thus that these constants have defined values.


r/numbertheory • • Dec 09 '25

You cannot name a number in the top n percentile of all numbers

338 Upvotes

Just a thought I had.. infinity is so large that any number you name will be in the bottom 50% of all numbers, the bottom 1% of all numbers, the bottom 0.000000000001% of all numbers, and infinitely many zeros hence. You cannot name a number in the top n, no matter what the number is and no matter what n is.


r/numbertheory • • Jun 01 '23

Can we stop people from using ChatGPT, please?

263 Upvotes

Many recent posters admitted they're using ChatGPT for their math. However, ChatGPT is notoriously bad at math, because it's just an elaborate language model designed to mimic human speech. It's not a model that is designed to solve math problems. (There is actually such an algorithm like Lean) In fact, it's often bad at logic deduction. It's already a meme in the chess community because ChatGPT keeps making illegal moves, showing that ChatGPT does not understand the rules of chess. So, I really doubt that ChatGPT will also understand the rules of math too.


r/numbertheory • • May 29 '25

Found a quadratic that generates 18 primes in a row: P(x) = 2x² + 2x + 19 (x = 0 to 17). Is this a known pattern?

225 Upvotes

Hii I am back again, I'm 15 from Ethiopia and was playing with quadratic formulas when I discovered this:P(x) = 2x² + 2x + 19 It outputs primes for every integer x from 0 to 17.

Here’s what happens from x=0 to x=17: x=0: 19 (prime)
x=1: 23 (prime)
x=2: 31 (prime)

  • ...

  • x=17: 631 (prime)

It finally breaks at x=18 (703 = 19×37).

Questions: 1.Is this already documented? (I checked—it’s not Euler’s or Legendre’s!)

2.Why does the ‘2x²’ term work here?* Most famous examples use x².

Thanks for reading!


r/numbertheory • • Jan 30 '24

Clarification/Formalization of the goldbach conjecture 'proof'

175 Upvotes

It seems that some people have issues trying to understand u/peaceofhumblepi’s proof on Goldbach’s conjecture. It got a lot of engagement so I suppose people might be interested in how the proof works. I believe I understand it (I wrote code, drew up graphs etc) and I’ve formalised it a little bit (I tried to make it as accessible to both mathematicians and those without formal math training). This was in response to a comment I made, but I feel a new thread would help raise visibility (also made a graph for the post).

I took some time to understand your proof and it seems that I misunderstood your method of finding pairs. I’ve updated the code and successfully replicated your results. If I understand correctly, the idea of this pairs counting method is as follows:

Let n be an arbitrary even number. The intuition behind this method is that we iteratively remove all numbers divisible by prime numbers, and we also remove numbers that would’ve formed a pair with those numbers. Since we know that the largest prime divisor of n is sqrt(n) (not true but will address later), we only need to repeat this process until the largest prime that’s also smaller than sqrt(n). We double count but I’ll address also that later. The idea is that you will have a set of primes remaining, and this set of primes will contain two that add up to n, thus satisfying the goldbach conjecture, and this set of primes grow as n grows.

  1. Let n be an arbitrary even number. There are a set of n/2 odd numbers in the interval (0, n). Let’s denote this set as O = {2n+1 : n in {0, … , n/2-1)}. For example, if n = 100, O = {1, 3, 5,…, 99}. For the sake of argument, let’s say that n is very big.

  2. We know that there the largest prime divisor of n is bounded by sqrt(n), so define set of prime numbers P = {3, 5, …, p_n} where p_n is the largest prime number smaller than sqrt(n). In the example above, sqrt(100) = 10 and P = {3, 5, 7}.

  3. Our goal is to use the sieve to reduce O into a set of prime numbers that can potentially contain p and q such that p+q = n. Denote |O| as the number of items in O.

  4. 1/3 of the numbers in O are divisible by 3. For any element x in O, there exists an element y such that x+y = n. If x is divisible by 3, then it must be removed. Since x is the only number that can form a pair with y, then we must remove y as well.

  5. Therefore, 2/3 of numbers in O are not suitable candidates to form a pair. So, we form a set O’ that does not contain these numbers. Notably, |O’| = |O| - 2/3 |O|. In other words, the size of O’ = size of O - 2/3 * size of O. In our example above, 1/3 of numbers from 0 to 100 are divisible by 3, and another 1/3 would form a pair with those numbers, so the size of our new set after removing all o these numbers is 100-2/3(100) = 66.66

  6. We repeat this process for 5. There are 1/5 numbers in O’ that are divisible by 5. We remove 2/5 of numbers from O’ to form O’’. Why 2/5? It’s because 1/5 of them are divisible by 5 so we remove them. After removing those, 1/5 of the numbers don’t have a number to pair to add up to n, so we remove those as well, thus giving us 2/5.

  7. The size of O’’ = |O’| - 2/5 |O’|, or the size of O’’ = size of O’ - 2/5 * size of O’

  8. We repeat this process up till p_n. Let’s say we end up with a set O^(p_n).

  9. We know O^(p_n) is nonempty since it must contain P and primes that were not filtered. Additionally, O^(p_n) must only contain primes since we’ve removed all numbers who are divisible by primes (aka composite).

  10. Note that as n increases, |O^(p_n)| (the number of possible primes n contains that can form a pair) tends to increase as well. Therefore there must exist a pair of primes p and q such that p+q = n

Let me know if there’s any confusion.

To clarify OP’s original calculations, I’ve pasted them here:

Let n = 10,004. There are 10,004/2 = 5002 odd numbers.

Below are the list of primes less than sqrt(10,004) approx 100:

[3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]

We begin the reduction process

5002.0 - 2/3(5002.0) = 1667.33

1667.33 - 2/5(1667.33) = 1000.4

1000.4 - 2/7(1000.4) = 714.57

714.57 - 2/11(714.57) = 584.65

584.65 - 2/13(584.65) = 494.7

494.7 - 2/17(494.7) = 436.5

436.5 - 2/19(436.5) = 390.56

390.56 - 2/23(390.56) = 356.59

356.59 - 2/29(356.59) = 332.0

332.0 - 2/31(332.0) = 310.58

310.58 - 2/37(310.58) = 293.79

293.79 - 2/41(293.79) = 279.46

279.46 - 2/43(279.46) = 266.46

266.46 - 2/47(266.46) = 255.13

255.13 - 2/53(255.13) = 245.5

245.5 - 2/59(245.5) = 237.18

237.18 - 2/61(237.18) = 229.4

229.4 - 2/67(229.4) = 222.55

222.55 - 2/71(222.55) = 216.28

216.28 - 2/73(216.28) = 210.36

210.36 - 2/79(210.36) = 205.03

205.03 - 2/83(205.03) = 200.09

200.09 - 2/89(200.09) = 195.59

195.59 - 2/97(195.59) = 191.56

We stop at 97 since that’s the largest prime that’s smaller than sqrt(10,004) approx 100

Here’s a critique of the proof:

There a few minor mistakes that make the proof slightly confusing, but nothing that invalidates it:

  1. You double count numbers. I think(?) you address this. Some pairs may consist of numbers that are both divisible by primes, and your method “removes” these numbers twice. For example, say we’re using this method on the number 44. 9 and 35 forms a potential pair. With your method, we would remove both 9 and 35, but on the second iteration, since 35 is divisible by 5, we would remove 35 again. So it’s more fair to say that we are finding a lower bound for the number of pairs of primes n contains rather than the actual amount. This is fine.

  2. You ignore 2 as a prime. But this is fine since you can add 1 back to your total count. You don't need to add 2 back since even + odd = odd.

  3. Your assumption that there can be at most one prime factor greater than sqrt(n). Call it p’. It’s entirely possible that n/2 > p’ > sqrt(n) (consider n=20 and p’=5), so there can be multiples of p’ in the range (0, n). But this is fine since your double counting would’ve handled this case. If you were to refine this method then this is an important edge case to consider.

Your steps for finding a lower bound works. Your steps from 1-9 are valid. However, the mistake that invalidates this proof is the jump from 9-10.

Your core argument is that as n increases, the number of primes tend to increase as well, making it increasingly improbable that we do not observe a prime pair. Both parts are incorrect.

The first part of the argument is that argument is that as n increases, the number of primes increases. This is not necessarily true. I graphed the number of possible primes as a function of n. While the graph indicates an increasing trend, the graph isn’t smooth - there are dips in the number of possible primes.

Here are a few cases you can verify yourself:

24 has 4.0 primes. 26 has 2.6 primes. Difference of 1.4

48 has 4.8 primes. 50 has 3.57 primes. Difference of 1.23

120 has 8.57 primes. 122 has 7.13 primes. Difference of 1.44

168 has 9.82 primes. 170 has 8.41 primes. Difference of 1.41

The differences might be small, but the fact that there are dips raises concern for the validity of your argument.How can we be sure that the number of primes will continue to grow? How do we know the primes will never plummet to 1 (or some tiny number)?

Furthermore, the differences don’t follow an obvious trend. How do the differences change? When do they change? (Hint it’s when you cross between a square number whose root is a prime)

EDIT: A huge issue is that your method isn't even correct per this user's comment: https://www.reddit.com/r/numbertheory/comments/1aecl8r/comment/kk7wywo/?utm_source=share&utm_medium=web2x&context=3

Those counterexamples invalidate your approach. I've verified them as well.

The biggest issue, however, is the second part of the argument - that there must be a prime pair. O^(p_n) doesn’t tell you anything about how the primes are distributed. It doesn’t tell you that there exists two primes p and q such that p+q=n. What’s stopping the case where all primes happen to be less than x/2? What’s stopping the case where no primes form a pair? You never address this in your proof.

The biggest issue is the last part - that O^(p_n) is nonempty. This is not necessarily true and you haven't been able to prove it. It's entirely possible that the algorithm removes everything in the set.

In summary here are the main critiques:

  1. Your claim that as the number increases, the more possible primes that create a pair increases is incorrect. I showed that there’s a possibility for a decrease in possible primes based on your framework, and we don’t fully understand the behaviour of this decrease, so you can’t say for sure whether this increasing trend will follow, no matter how small the dips may be.

  2. EDIT: your method isn't correct to begin with per this comment https://www.reddit.com/r/numbertheory/comments/1aecl8r/comment/kk7wywo/?utm_source=share&utm_medium=web2x&context=3

  3. Your claim that there must exist primes that form a pair is also incorrect, even though it’s incredibly improbable that this doesn’t happen. Again, just because it’s improbable doesn’t mean it’s impossible. EDIT: per this comment: https://www.reddit.com/r/numbertheory/comments/1aetw3a/comment/koaoauz/?utm_source=share&utm_medium=web2x&context=3 , the algorithm always guarantees pairs. Each odd in the set is paired with another odd. Since the algorithm removes a pair of odds, and each number is paired to another unique number in the set, we are guaranteed to have a set where each prime is paired.

  4. You claim that you are guaranteed to have a set of paired primes remaining. This isn't true, since the algorithm you proposed does not guarantee that it will give a nonempty set.

I’ll emphasise one last time - just because something looks incredibly likely doesn’t mean that it’s the truth. Here’s a post that describes exactly that. The math isn’t important. It’s the fact that something that seems intuitive may not turn out to be true at all.:

https://mathoverflow.net/questions/35468/widely-accepted-mathematical-results-that-were-later-shown-to-be-wrong

I’ll cite parts of the article:

“Many mathematician's gut reaction to the question is that the answer must be yes and Minkowski's uniqueness theorem provides some mathematical justification for such a belief”

“Nevertheless, in 1975 everyone was caught off-guard when Larman and Rogers produced a counter-example showing that the assertion is false in 𝑛≥12”

And to u/peaceofhumblepi, on a personal note, you claim that you can only write in 1st year high school style and ask for people to critique on the content. But if the content is so hard to understand from the writing, then how else can we critique it? If you say that we’re misunderstanding your proof, well… isn’t that expected due to its poor style and quality of writing? And somehow you can’t believe that people don’t understand your proof because your proof is difficult to understand to begin with? The part that bothers me the most is your dismissive and crass responses when people ask questions. You either claim that they don’t understand, or repeat something already said.

I don’t blame you for being able to write at your current level, but if you want to engage in mathematical discussion at a high level, then you should do yourself a favour and learn how to read and write proofs and maybe learn to code. Being able to communicate your ideas clearly is showing respect to the reader. This is coming from someone who was paid to grade 100s of pages of proofs.

If you’ve read all the way, thanks for doing so. This was the first post on r/numbertheory I saw and I can’t believe I went down this rabbit hole. Probably gonna be my last time on this sub for my sanity.


r/numbertheory • • May 13 '26

Direct Proof of the Irrationality of e

Post image
148 Upvotes

Since e is generally proved to be irrational by contradiction, I wanted to write a proof that directly shows it cannot be rational. When I presented this to Claude it took some cajoling for it to say the proof was correct, and it was unable to find a similar/direct proof, so if my logic isn't clear or has errors I would appreciate any critiques and am interested if anyone has encountered a direct proof like this one.

Edit: The reason I believe this proof is direct as opposed to by contradiction is because I never assume e=p/q and derive a contradiction; rather, I show that e cannot equal any rational p/q.


r/numbertheory • • Feb 07 '24

Numbers Question

Post image
137 Upvotes

Non-math PhD (ABD) here. After listening to Radiolab’s recent podcast on zero, I’m wondering what mathematicians think about natural numbers having more than one meaning based on dimensions present in the number’s world. If this is a thing, what is the term for it. I’d like to learn more.


r/numbertheory • • Oct 07 '24

I might have a proof to a longstanding problem

112 Upvotes

I'm an amateur mathematician (with a PhD in computer science, so with some technical background) that loves to do recreational math, and as such love all the classic math-related channels on YT. A problem that's been presented on Numberphile, the problem of the existence of a 3x3 magic square of squares has captivated me for some time now and I believe I've managed to solve it by proving its non-existence. I tried posting my proof (albeit, some previous versions which had some problems that I've ironed out in the meantime) on both mathoverflow and math stackexchange, but was met with the classic push-back an amateur mathematician can expect when implying to have found a solution to such a problem. And I get it - rarely are these correct, and as I have been a witness myself throughout this process, as an amateur I often get the technical details wrong, details that in the end invalidate the whole proof.

However, since I wholeheartedly believe that my proof stands, I decided I post it here and hope for the best. I'm at a state where I just want to get it out there, for better of for worse, and since I don't have any other way of reaching an audience that cares, I have few options but this. I've written it up in a PDF (LaTeX) file that I'm linking here, as well as a Wolfram Mathematica notebook that accompanies the proof and validates (as much as it can) all statements made in the proof itself. Here goes nothing...


r/numbertheory • • May 02 '25

Collatz problem verified up to 2^71

110 Upvotes

On January 15, 2025, my project verified the validity of the Collatz conjecture for all numbers less than 1.5 × 271. Here is my article (open access).


r/numbertheory • • Jul 08 '25

floor(k·x)%2 encodes symbolic billiard paths, revealing recursive structure in Fibonacci-sized grids and an unexpected equivalence to perfect shuffle sequences

99 Upvotes

The idea for this nonsense was born somewhere in 2002 during a boring lesson at school, then it took the form of an article on habr in 2012, then it was revisited many times, and finally I translated it into English.

You begin by drawing a diagonal, dashed line across a rectangular grid - simulating a billiard path reflecting off the walls. The construction is simple, but the resulting patterns are not.

Surprisingly, the shape and symmetry of each pattern depends entirely on the rectangle’s dimensions.

When the rectangle dimensions follow the Fibonacci sequence, the paths form intricate, self-similar structures. Kinda fractal-y (shouldn't I hide this word under the nsfw tag?)

By reducing the system step by step, the 2D trajectory can be collapsed into a 1D sequence of binary states. That sequence can be expressed symbolically as:

  Qₖ = floor(k·x) mod 2

Despite its simplicity, this formula encodes the entire pattern. With specific values of x, it produces sequences that not only reconstruct the full 2D pattern, but also reveals fractal structure.

Even more unexpectedly, these sequences are bitwise identical to those generated by a recursive perfect shuffle algorithm - revealing a nontrivial correspondence between symbolic number theory and combinatorial operations.

I mean seriously. If you arrange the cards in a deck so that the first half of the deck is red and the other half is black, and then you shuffle it with the Faro-Shuffle a couple of times, the order of the black and red cards will form a fractal sequence similar to floor(k·x) mod 2. How cool is that?

Demo

Mirror demo (in case the first one doesn't load)

Article: https://github.com/xcontcom/billiard-fractals/blob/main/docs/article.md


r/numbertheory • • Nov 03 '23

Collatz problem verified up to 1.5 × 2^70

89 Upvotes

On November 3, 2023, my project verified the validity of the Collatz conjecture for all numbers less than 1.5 × 270 (= 1536 × 260). This is the moment when the length of a non-trivial cycle raises to 355 504 839 929. (For details, see the article from Hercher, C. (2023). "There are no Collatz m-cycles with m <= 91" (PDF). Journal of Integer Sequences. 26 (3): Article 23.3.5.)


r/numbertheory • • Apr 14 '26

Playing with numbers I have found this approximation of pi. It could have been competitive in the 17th century...

Post image
87 Upvotes

r/numbertheory • • Jul 16 '23

RIEMANN HYPOTHESIS: Redheffer matrix and semi-infinite construction

79 Upvotes

See the paper

The Riemann Hypothesis is the conjecture that the Riemann zeta-function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in mathematics (the zeros of the Riemann zeta-function are the key to an analytic expression for the number of primes).

The Riemann Hypothesis is equivalent to the statement about the asymptotics of the Mertens function, the cumulative sum of the Mobius function. The Mertens function, in its turn, can be represented fairly simply as the determinant of a matrix (the Redheffer matrix) defined in terms of divisibility (square matrix, all of whose entries are 0 or 1), where the last can be considered as adjacency matrix, which is associated with a graph. Hence, for each graph it is possible to construct a statistical model.

The paper outlines the above and it presents an algebra (as is customary in the theory of conformal algebras), having manageable and painless relations (unitary representations of the N = 2 superVirasoro algebra appear). The introduced algebra is closely related to the fermion algebra associated with the statistical model coming from the infinite Redheffer matrice (the ith line can be viewed as a part of the thin basis of the statistical system on one-dimensional lattice, where any i consecutive lattice sites carrying at most i − 1 zeroes). It encodes the bound on the growth of the Mertens function.

The Riemann zeta-function is a difficult beast to work with, that’s why a way is to replace the divisibility.


r/numbertheory • • Sep 16 '25

Secrets of Sphere Packings and Figurate Numbers

Post image
76 Upvotes

r/numbertheory • • Nov 10 '25

Prime Numbers as an Iterative Spiral

Post image
68 Upvotes

Whilst playing with numbers, as you do and thinking about prime numbers and n-dimensional mathematics / Hilbert space, I came upon a method of plotting prime spirals that reproduces the sequence of prime numbers, well rather, the sequence of not prime numbers along the residuals of mod 6k+/-1

Whilst it is just a mod6 lattice visualisation, it doesn’t conceptually use factorisation, rather rotation, which is implemented using simple indexing, or “hopping” as I’ve called it. So hop forwards 5 across sequence B {5,11,17,23,35} and we arrive at 5•7, hop 5 backwards into sequence A from sequence B {1,7,13,19,25} and we find the square, this is always true of any number.

Every subsequent 5th hop knocks out the rest of the composites in prime order. Same for 7, but the opposite, because it lies on Sequence A. The pattern continues for all numbers and fully reproduces the primes - I’ve tested out to 100,000,000 and it doesn’t falter, can’t falter really because the mechanism is simple modular arithmetic and “hop” counting. No probability, no maybe’s, purely deterministic.

Would love your input, the pictures are pretty if nothing else. Treating each as its own dimensions is interesting too, where boundaries cross at factorisation points, but that’s hard to visualise, a wobbly 3D projection is fun too.

I flip flop between

  • This is just modular arithmetic, well known. And,

  • This is truly the pattern of the primes

https://vixra.org/pdf/2511.0025v1.pdf


r/numbertheory • • May 30 '23

Einsteins energy theory balanced

66 Upvotes

I saw somebody (I believe from India) who added AI to his equation. It rubbed me the wrong way, it seemed completely out of place so I felt the need to balance it out.

  • update I altered it a bit

E=mc²∵∞=∀²

  • Energy equals matter collided squared because infinity equals all things squared


r/numbertheory • • Sep 07 '25

Alternative Formula for P-Adic Valuation of Numbers

Post image
58 Upvotes

Hi everyone, this is my first post on Reddit. I’m an attorney with a background in math who dabbles in number theory here and there. Recently, while working on a problem, I wanted a formula for the P-adic valuation of n (v_p(n)) that had a single term in the sum, unlike the formula you find on Wikipedia, which has two terms within the sum. This is what I came up with. I haven’t found this elsewhere online, and am curious what you think. In my view, having a single term is preferable in some instances. For example, if your v_p(n) is in an exponent, then the sum can be rewritten as a product that factors cleanly.


r/numbertheory • • Apr 01 '26

An approximation of the square root developed from the Taylor series.

Post image
57 Upvotes

Hello, I’ve been exploring square root approximations by refining the Taylor series. My approach incorporates elements of the Newton-Raphson method, utilizing numerical observations to minimize the residual error.

Variable Definitions:

a

(Reference Base): A chosen reference value, typically a perfect square closest to x, serving as the primary base for the approximation.

b

(Residual Offset): The difference between the target value and the reference base, defined as b = x - a

x₁ , x₂ , x₃

x₁ (The Linear Term):

Defined as √a + b/2√a

x₂ (The second-order refinement):

Defined as x₁ - b²/8ax₁

x₃ (The final residual compensator):

Defined as x₂ - b²/(32ax₂(2a + b)²)

If even greater accuracy is required, the result x_3 can be used as the new base (a) for the next iteration. By updating the offset as b = x - x₃², the approximation will progressively converge to the true value with significantly higher precision.

Please note that this formula may still be a work in progress. I welcome any feedback or corrections if errors are found. Regarding a formal mathematical proof, I must apologize as this approach was developed primarily through numerical observations of residual errors rather than a traditional derivation. Any insights to further refine this method would be greatly appreciated.


r/numbertheory • • Feb 16 '26

A relationship between the Collatz conjecture and the Fibonacci numbers

Thumbnail vincentrolfs.dev
57 Upvotes

Hi all, it seems I discovered a previously unknown relationship between the Collatz conjecture and the (signed) Fibonacci numbers. It is a continuation of prior work by Bernstein and Lagarias. I would be super grateful for any feedback. Thank you!


r/numbertheory • • Nov 17 '25

Is 1001 the only palindrome which is a product of three consecutive primes?

54 Upvotes

I made a computational search for over all integers N < 10^27.

Method:

  • Generate a list of primes up to 10^9

  • Iterate over consecutive prime triples and compute the product

  • Check each product for being a palindrome via string reversal Result: 1001(71113) was the only palindrome.

Then i tried generilized version with k consecutive prime numbers for k from 3 to 1000 the same way.

Result:

5005 and 323323 are the only palindromes for k= 4 and 5 and there was none such numbers for k>6 up to 1000.

Generalized Conjecture : For any natural number k > 5 there does not exist a palindromic number n that is a product of k consecutive prime numbers. In other words: 1001, 5005 and 323323 are the only three palindromic products of k ≥ 3 consecutive primes in the entire set of natural numbers.

Open Questions:

  1. Can the generalized conjecture be proved?

  2. If it is true are there any mathematical consequences from it?


r/numbertheory • • May 19 '24

Thoughts on dividing by 0

53 Upvotes

Hello, I'm 18 yr and while I was learning complex numbers I had this idea of making the same thing for division by 0. Probably someone already had this idea, or it doesn’t work and I didn’t figure it out, but I want to know what you think of this and if you can find any utility. Sorry if my English is not the best because it's not my first language.

So, consider an imaginary number, like i, that I will be calling j.

The definition of j is

0*j=1

So:

j=1/0

And I don't know if I can do that according to math rules, but from now on I will consider both of them true.

That means:

j^a=j ,a⊂R & a>0

Because:

(1/0)*(1/0)*(1/0)*...=(1*1*1*...)/(0*0*0*...)=(1/0)=j

And:

j^a=0 ,a⊂R & a<0

Because:

1/[(1/0)*(1/0)*(1/0)*...]=1/[(1*1*1*...)/(0*0*0*...)]=1/(1/0)=0

And:

j^0=1 <=> j^1 j^-1=1 <=> j*0=1

Ok, so now I don’t really know what to do with this information, I could consider a+bj, a & bR, that would be a complex-like number and I could do the normal operations with it like:

Addition:

(5+2j) + (1-9j) = (5+1) + (2-9)j = 6 - 7j

(a+bj) + (c+dj) = (a+c) + (b+d)j

Subtraction:

(3+12 j) - [(- 32) + 12 j] = (3+32) + (12-12) j = 32+ 0j

(a+bj) - (c+dj) = (a-c) + (b-d)j

Multiplication:

(2 + 4j)*(7-2j) = (2*7) + ( 4*7 + 2*2)j + [4*(-2)]j^2 = 14 + 32j-8j^2 = 14 + 32j -8j = 14+24j

(a + bj)*(c+dj) =(a*c) + (b*c + b*d + a*d)j

And I still didn’t figure out, how to do division, I tried this but it seems wrong:

(4+8j)/(1-2j)=[(4+8j)*0]/[(1-2j)*0]=[(4*0+8j*0)/(1*0-2j*0)=8/(-2)=-4

(a+bj)/(c+dj)=[(a+bj)*0]/[(c+dj)*0]=(b/d)

To finish I will end with the last thing I was trying to discover, and that’s:

a^j= ?, a⊂R

I try to use Geogebra and make the functions:

f(x)=x^(((1)/(0.000001))) & g(x)=x^(((1)/(-0.000001)))

So functions that get very close to 1/0, and this is the result

I don’t know if I can assume that, because the functions are getting closer to 0 and than in 1 and -1 they are going to infinity:

a^j=0, a ]-∞,-1[ ]-1,1[ ]1,+∞[

So, that’s it, if you have any thoughts on this or you can find something useful to do with it.


r/numbertheory • • Dec 11 '25

An unimaginably large number i came up with

52 Upvotes

I guess you all have heard about googolplex which is 10^googol which already is astronomically large and even if one zero was written on each atom of the universe you would need quadrillions of times more atoms to even write it. Now there is a function named tetration(↑↑) which essentially forms exponent towers say 3↑↑4 = 3^3^3^3 which is 3^3^27 which is like 3^7 trillion , so a↑↑b is a^a^a^a.. b times (exponent tower for a of height b). A pentation(↑↑↑) is a recursion over the existing tetration, so 3↑↑↑4 = is 3↑↑3↑↑3↑↑3 which already is extremely huge if you try to calculate it, it already dwarfs the googolplexian(10^googolplex) the exponent towers height would probably reach the sun if you start writing it on earth.

Now that we see how powerful pentation(↑↑↑) is over tetration(↑↑) , we could have hexation (↑↑↑↑) which would mean 3↑↑↑↑4=3↑↑↑3↑↑↑3↑↑↑3 which would be so large it would be extremely difficult to come up with a physical analogy to explain how tall the tower would be.

What if i repeat this to (↑↑↑↑↑↑↑↑↑↑.... to 1 googolplex arrows) so it it is esssentially googolplexation. How big would be the number googolplex googolplexated a googolplex times (a↑↑↑↑↑↑↑↑......↑↑↑↑↑↑b) form compared to something like other very large numbers like tree(3) or grahams number.

Could i create a new number name like "G-G-G number" defined as (G ↑^G G) where G->googolplex.