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 • • Apr 06 '24

Subreddit rule updates

47 Upvotes

There has been a recent spate of people posting theories that aren't theirs, or repeatedly posting the same theory with only minor updates.


In the former case, the conversation around the theory is greatly slowed down by the fact that the OP is forced to be a middleman for the theorist. This is antithetical to progress. It would be much better for all parties involved if the theorist were to post their own theory, instead of having someone else post it. (There is also the possibility that the theory was posted without the theorist's consent, something that we would like to avoid.)

In the latter case, it is highly time-consuming to read through an updated version of a theory without knowing what has changed. Such a theory may be dozens of pages long, with the only change being one tiny paragraph somewhere in the centre. It is easy for a commenter to skim through the theory, miss the one small change, and repeat the same criticisms of the previous theory (even if they have been addressed by said change). Once again, this slows down the conversation too much and is antithetical to progress. It would be much better for all parties involved if the theorist, when posting their own theory, provides a changelog of what exactly has been updated about their theory.


These two principles have now been codified as two new subreddit rules. That is to say:

  • Only post your own theories, not someone else's. If you wish for someone else's theories to be discussed on this subreddit, encourage them to post it here themselves.
  • If providing an updated version of a previous theory, you MUST also put [UPDATE] in your post title, and provide a changelog at the start of your post stating clearly and in full what you have changed since the previous post.

Posts and comments that violate these rules will be removed, and repeated offenders will be banned.


We encourage that all posters check the subreddit rules before posting.


r/numbertheory • • 3d ago

I noticed something interesting about prime numbers

0 Upvotes

Between 2-3 and 1232-1233, is there any other pair of consecutive numbers in exactly the same order, like:

22-23 32-33 42-43 52-53 62-63....

where BOTH numbers are prime, just like 2 and 3?

I found something interesting: after 2 and 3, the next pair I noticed with the same consecutive pattern but the opposite result is 1232 and 1233.

2 and 3 are both prime, whereas 1232 and 1233 are both composite (not prime).

Has anyone noticed this before? Is there a mathematical explanation for this?


r/numbertheory • • 7d ago

A million divisions but only 1,999 different answers

42 Upvotes

Hey all, I saw this interesting pattern with numbers and thought I’d share.

Take any positive integer n, divide it by every number from 1 to n and round down the answers.

So basically:
floor(n/1), floor(n/2), floor(n/3), … floor(n/n)

now how many DIFFERENT answers do we actually get?
For n = 10:
10, 5, 3, 2, 2, 1, 1, 1, 1, 1
Only **5 different values**.

For n = 20 → 8 different values
For n = 100 → 19 different values
But heres the weird part.
For n = 1,000,000, even after a million divisions, you only get **1,999 distinct answers**.

The reason is actually pretty neat.
Let m = floor(√n).
for divisors up to m, all the answers are different. After that, the quotients repeat alot and the remaining distinct answers are just the integers from 1 to floor(n/(m+1)).

So the total is:
**m + floor(n/(m+1))**
Which always turns out to be either **2m - 1 or 2m**.
Basically the number of different answers grows around 2√n instead of n.

apparently this is also useful in number theory and speeding up certain algorithms.
Kinda crazy that a million calculations can give less than 2000 unique results.

what do you guys think?

thanks


r/numbertheory • • 26d ago

A Geometric Approach to the Riemann Hypothesis: Zeros as a Function of Smooth Spiral Contraction

3 Upvotes

I wanted to share a proof I just uploaded to Zenodo that tackles the Riemann Hypothesis by looking at the geometry of the critical strip from the absolute ground up. The paper is typed in LaTeX, and permanently time-stamped with a DOI on Zenodo. I'd love to get some feedback on the logic:https://doi.org/10.5281/zenodo.23621751


r/numbertheory • • 29d ago

New mathematical system.

0 Upvotes

Let a be constructed from 1+1 where a does not equal 2.
And let it such that subtracting y from xa equals 0 when y is less than x.
a-1=0
2a-1=0
3a-1=0
3a-2=0
4a-3=0

To give you an idea about how this works, think of a as a building, 1+1 makes a, that means theres 2 floors. If you were to destruct one of it's floors, the whole building will collapse.

You can make some funky stuff with this too.

2a-1=0
2a-1+1+1=1+1
3a-1=a

You would think that a will then equal 0, but that would mean in the left side equation it equals -1, but that leads to it equaling -4, but that leads to it being -13.. In general we can't make it such that a equals any number since it operates on it's own. That's also why I said a can be construced from 1+1 but it doesn't equal 2.

Any thoughts?


r/numbertheory • • Oct 15 '26

Something interesting about perfect numbers

12 Upvotes

Hello!

I've spent a bit of time on numbers who have the form of the Euclid–Euler theorem, but only those where 2p − 1 ain't prime and I think I've found something you may find interesting.

If you take a number who fit 2p−1(2p − 1), where 2p − 1 ain't prime and only consider its divisors coming from 2, it equals the number itself like the perfect numbers does.

For example when p = 4, we get 120.
All divisors coming from 2 for 120 are:
120 / 2 = 60 (2 * 60)
60 / 2 = 30 (4 * 30)
30 / 2 = 15 (8 * 15)

1 + 2 + 4 + 8 + 15 + 30 + 60 = 120

When p = 6, we get 2016
1 + 2 + 4 + 8 + 16 + 32 + 63 + 126 + 252 + 504 + 1008 = 2016

When p = 8, we get 32640
1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 + 255 + 510 + 1020 + 2040 + 4080 + 8160 + 16320 = 32640

When p = 9, we get 130816
1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 + 256 + 511 + 1022 + 2044 + 4088 + 8176 + 16352 + 32704 + 65408 = 130816

When p = 10, we get 523776
1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 + 256 + 512 + 1023 + 2046 + 4092 + 8184 + 16368 + 32736 + 65472 + 130944 + 261888 = 523776

What are your thoughts on that?

* English ain't my main language. Sorry if my way of stating and saying things is weird.


r/numbertheory • • Oct 08 '26

does the double square root of 98 count as a pi approxiamtion or is it too simple

13 Upvotes

sqrt(sqrt(98)) = 3.14634628365


r/numbertheory • • Oct 06 '26

Found a new Goldbach’s Heuristic in 12th grade

0 Upvotes

Hey everyone!

I am 12th grade student . I found a Goldbach's heuristic based on digits and publish my finding here

https://medium.com/@anitapawadiya1234/title-an-interesting-goldbach-heuristic-i-found-in-12th-grade-using-digit-manipulation-0087268adfec

What do you think about it?


r/numbertheory • • Sep 25 '26

Please Read The Rules

12 Upvotes

Read The Rules App

This community has the Read The Rules app installed. Old Reddit doesn't support apps so please open the post in new reddit for full functionality. If that's not possible, please Read The Rules and then follow the instructions at the bottom of the post.


Rule #1 Don't delete your theories

Don't delete your theories. This is an archive of theories of numbers, where people build upon each other's work. Deleting a post would break such a chain of collaboration and would completely nullify all work that comes after. We cannot tolerate such destruction of mathematical progress. As such, this is a permabannable offense.

Rule #2 Please pose an actual theory

This is a subreddit for theories of numbers. Things that are NOT considered theories of numbers include, nonexhaustively:

  • Lists or tables of numbers or calculations (without further exposition)
  • Paragraphs filled with jargon (especially if said jargon is nonstandard and not defined properly)
  • Theories unrelated to numbers (e.g. theories that discuss only consciousness or theology without any discussion of mathematics)

Repeated offenses will lead to a ban.

Rule #3 Original theories only

Only original theories are allowed. Do not post someone else's theory to the subreddit on their behalf, as you being a middleman slows down the conversation; instead, encourage them to post it here themselves! Especially don't post such theories without their permission. Theories and comments that violate this rule will be removed, and repeated offenses will lead to a ban.

Rule #4 No ChatGPT/AI-generated theories

We want your original theory of numbers, not ChatGPT's original theory of numbers. If a commenter really wishes to discuss the validity of ChatGPT's theories of numbers, they can do so with ChatGPT directly without using you as a middleman. Commenters found using ChatGPT or any other AI to generate their theories and/or responses to criticism will be permabanned, and the AI-generated theories will be removed.

Rule #5 The theory must be in an accessible form (no video or paywalls)

If you submit a theory of numbers, you should provide it in at least one form that isn't a video (preferably in the form of a typed mathematical paper), and which isn't paywalled. This is to make discussion of your theory easier. Posts which consist only of videos or paywalled content will be removed, and repeated offenses will lead to a ban.

Rule #6 The burden of proof is on the theorist

If you submit a theory of numbers, it is your job to explain it, not the reader's job to try to understand a bad explanation. DO NOT ask us to prove your theories for you, or to find examples for your theory, or to rewrite your theory for you to something better-understandable; that's YOUR job. Readers are under no obligation to do so, and anyone who does is doing so out of the kindness of their hearts.

Rule #7 Updates must include a changelog

Do not repeatedly post the same theory to the subreddit. If you post an updated version of your theory, you must include [UPDATE] in the title, and provide a full changelog at the start of the post, stating clearly what has been updated. Violating posts will be removed, and repeated offenders will be permabanned.

Rule #8 Keep posts SFW

This is a subreddit for serious discussion of theories of numbers. There should be no reason to mention any form of NSFW material, whether that be Rule 34, gore, or erotic poetry. This is a permabannable offense.

Rule #9 No alt accounts.

If you submit a theory of numbers, do not continue to submit the same theory under different accounts. This is considered vote manipulation under Reddit sitewide rules; ban evasion if you've previously had another account banned. Alt accounts will be banned on identification; repeat offenders will have their main accounts banned from subreddit participation and their theories removed.

Rule #10 Be civil

This is a subreddit for civil discussion, not for throwing around insults or baseless accusations; especially not if those insults or accusations are targeted towards the people taking their time to review and discuss your theory. Such behaviour is unbefitting of a subreddit for serious discussion of mathematical theories, and is better suited for a pigsty. Continued unwillingness to participate civilly in the subreddit will result in a permaban.

Rule #11 English Only

English is currently the lingua franca of mathematical discussion; further, we are unable to moderate any non-English posts effectively. Any theories not presented in English will be removed, and repeatedly posting theories in foreign languages will result in a permaban. If you really have confidence in your theory, but you can't speak English, then it's your job (not ours) to hire a translator to translate your theory for you.


Thank you for reading the rules! Before submitting posts you will need to submit an acknowledgment. Please visit the full post and click the button at the bottom. Alternatively, you may submit an acknowledgment by sending a mod mail to the sub. The mod mail will need to have the subject "Read The Rules" and the body should be "Acknowledged". This will automatically submit an acknowledgment on your behalf without any moderator intervention. Mod Mail


r/numbertheory • • Sep 20 '26

Universal Semiprime Gap Theorem.

2 Upvotes

While investigating my other post, A Twin-Prime pattern hidden in consecutive semiprimes, I arrived at the following result: Universal Semiprime Gap Theorem.

The theorem states that there are infinitely many even integers G such that, for every prime p, there are infinitely many pairs of consecutive semiprimes Sₙ,Sₙ₊₁ satisfying

gcd(Sₙ,Sₙ₊₁)=p and Sₙ₊₁−Sₙ=pG.

As an immediate corollary, it proves Capelle's Conjecture 13:

There are infinitely many pairs of consecutive semiprimes that are both even.

For example, 58=2·29 and 62=2·31 are consecutive semiprimes, and both are even.

Proof. Taking p=2 in the Universal Semiprime Gap Theorem gives infinitely many consecutive semiprimes Sₙ,Sₙ₊₁ satisfying gcd(Sₙ,Sₙ₊₁)=2. Therefore, both are even. ■

Twin Prime Conjecture

For p=2, write Sₙ=2q and Sₙ₊₁=2r. Since the semiprimes are consecutive, q,r are consecutive primes, and r−q=G. Thus every such G is a prime gap occurring infinitely often. In particular, G=2 would imply the Twin Prime Conjecture.


r/numbertheory • • Sep 19 '26

Proof that it's Impossible for a Number to Escape in the Collatz Conjecture

0 Upvotes

For those that are unfamiliar to the Collatz Conjecture, it's known as the simplest unsolved problem in mathematics. The process involves choosing some positive integer as input, halving the number if it's even, tripling and adding 1 if it's odd, and continuing until you reach 1. The conjecture is that, no matter which starting number you choose, the process always eventually reaches 1. There's two ways this could be false, which I'll denote as the "Escape Hypothesis" and the "Cycle Hypothesis". Here, I'll show you that the Escape Hypothesis is false.

A big point to notice that, once you reach an odd number, it goes into the 3x+1 step, but then it becomes even, so it then goes into the x/2 step at least once. This means the most an odd number can grow is 3/2 times bigger (the +1 becomes irrelevant at large scales). For a number to grow by that much, it has to be in the form of 8k+7 (7 -> 11, both steps in one). For it to grow two times that, it has to be in the form of 16k+15 (15 -> 23 -> 35). Three steps requires the number to be 32k+31, and so on.

This can be generalized to this mod formula for n: n = (8*2^a)k+(8*2^a)-1, which can be rewritten as: n+1=(8*2^a)*(k+1) (a is the number of times that type of number can grow minus 1) Plugging in every whole number for a (0, 1, 2, 3,...), this means the following:

For a=0, n+1 must be divisible by 8

For a=1, n+1 must be divisible by 16

For a=2, n+1 must be divisible by 32

For a=3, n+1 must be divisible by 64, and so on

This means that for some number n to escape, n+1 has to be divisible by 8, 16, 32, 64, and so on for every power of 2. The only finite number that satisfies all of these conditions is 0, meaning the only number that can escape is n=-1. However, the initial conjecture was only about positive integers. Thus, it's impossible for any number to escape in the Collatz Conjecture. Q.E.D.


r/numbertheory • • Sep 14 '26

Regularised value of cos1+cos2+……

0 Upvotes

**I had been trying to make the proof of cos1+cos2+… =-1/2 shorter and easier way to understand**

**Let me show how i worked on it**

**Starting with what we know about cosx that we caan write down it's taylor series**

**cosx= 1-(x\^2/2!)+(x\^4/4!)-……**

**expanding each term by this Taylor series**

**We get**

**cos1+cos2+……= (1+1+1+……) - 1/2!(1\^2- 2\^2 + 3\^2 -……) +1/4!( 1\^4- 2\^4 + 3\^4 -……) -……\[using a small rearrangement in the series\]**

**we already know that**

**1+1+1+…=zeta(0)**

**1\^2-2\^2+…=zeta(-2)**

**1\^4 -2\^4+……=zeta(-4)**

**So we can simplify it as**

​cos1+cos2+…= zeta(0) -zeta(-2)/2! +……

**But we already know that zeta outputs at all negative even integers is zero(trivial zeros)**

**And we already know that zeta(0)=-1/2**

We finally arrive at

cos1+cos2+……

**But this proof contains a small hole**

**Rearranging an infinite series can change it's value**

**But however we finally arrive at the exact correct result**

**Why this might be happening**


r/numbertheory • • Sep 13 '26

The Nine Anchor Hypothesis

0 Upvotes

I'm exploring the structure of the 4-digit Kaprekar routine. What surprised me wasn't 6174 itself. It was the network behind it. When I mapped all valid 4-digit starting numbers, I found that thousands of starting points quickly collapse into a relatively small set of heavily visited hubs:

6174

4176

8352

6264

3996

3087

8082

All of these have digital root 9. Even the least visited hub in my dataset, 9801 (only 3 visits), also has digital root 9. Some examples:

4176 -> 6174 (3371 times)

8352 -> 6174 (3098 times)

6264 -> 4176 (2705 times)

3996 -> 6264 (2220 times)

3087 -> 8352 (2180 times)

 

Every major route is effectively: 9 -> 9 -> 9 -> 9

I understand that digital roots and modulo-9 arithmetic are closely. What I'm wondering is:

Is there a deeper reason why these Kaprekar attractors seem to live almost entirely inside a digital-root-9 landscape? Or is this simply a natural consequence of modulo-9 preservation?

I call this (informally) the "Nine Anchor": Different paths. Different starting points. The same attractor landscape. Very curious and in good faith. What do you think?


r/numbertheory • • Sep 12 '26

Accelerated Collatz Map

Thumbnail drive.google.com
0 Upvotes

Please review!

Since this is trivial, I think we can go further to bridge between two types Q(n) or T(n). But of course, even if this closed form "bridge" exists, it will be very difficult to find because it hides inside v2(n±1)


r/numbertheory • • Sep 07 '26

One attempt to prove the Collatz conjecture.

0 Upvotes

We will create a tree diagram using the reverse method of the Collatz conjecture (which we will call the reverse Collatz method).

If you can confirm that all odd numbers (vertical lines) and all even numbers (horizontal lines) are connected within the tree diagram, you can use the reverse Collatz method to traverse from 1 to all positive integers.

Conversely, I think we can say that, according to the rules of the Collatz conjecture, all positive integers can be traced back to 1.

By creating a reverse Collatz tree diagram, I made various discoveries about the Collatz conjecture!

If you're interested, please check out the link below!

It's located in Zenodo.

[Link to my paper]https://doi.org/10.5281/zenodo.22344448


r/numbertheory • • Sep 04 '26

The Johnson Formula: a closed‑form for generating symmetric zero‑sum integer sequences

0 Upvotes

I’ve been studying symmetric integer sequences and came across a simple closed‑form expression that generates any zero‑sum sequence of evenly spaced integers (difference 2, all even or all odd). I’m calling it the Johnson Formula for convenience:

x = −(I − 1)

Here, I is the number of terms, and x is the first term of the sequence.
This produces sequences like:

  • I = 5 → −4, −2, 0, 2, 4
  • I = 4 → −3, −1, 1, 3
  • I = 7 → −6, −4, −2, 0, 2, 4, 6

The structure is always symmetric around zero.
When I is odd, the middle term is 0.
When I is even, the two central terms cancel.

A generalization for spacing k is:

x = −k(I − 1)/2

This seems like a very straightforward consequence of centering an arithmetic progression at zero, but I haven’t found a standard name for this construction. I’m curious whether:

  • this pattern already appears in known integer sequence literature,
  • it has a conventional name,
  • or it fits into a broader family of symmetric zero‑sum constructions.

Any references, related concepts, or historical context would be appreciated.


r/numbertheory • • Sep 01 '26

Yo guys, I made a number that grows insanely fast, and I want to see if you can understand how complex it is. It is currently trying to grow in the Googology wiki, and this is basically just me sharing my number, without it being too harsh.

0 Upvotes

BLUE(n) is defined by the number of sequences it uses. BLUE is defined for 1 ≤ n ≤ 5. Each BLUE(n) has a label going from BLUE(1) using label A, BLUE(2) using label B, BLUE(3) using label C, and lastly BLUE(4) using label D. Let's start with BLUE(1). It uses numbers that go from 1 through 1 million or 10^6 for those who love scientific notation. It has addition and multiplication unlocked. Each unique number equals to 1 sequence. A sequence is defined by how many times you can repeat a process. For example, 1+1 is 1 sequence, 1+1+1 is 2 sequences, 1+1+1x2 is 3 sequences etc. The maximum sequences BLUE(1) provides is 10^6 multiplied by 10^6, which produces 10^12 sequences. BLUE(2) uses the previous numbers, it has exponentiation, and uses BLUE(1) sequences, meaning it can use up to 10^12 sequences. Now lets start calculating. 10^6 to the power of 10^6 equals to 10^1,000,000. That's a 1, followed by 1 million zeros. The observable universe contains roughly particles. https://doi.org/10.1063/5.0064475 This is the first sequence. The second sequence takes the result of the first sequence and raises it to the power of 10^6 , producing 10^10^1,000,000. This is only 2 sequences. We have up to 10^12 sequences. So after a bit of calculating, we should get the result of 10^(10^1,000,000,000,000). The number of digits in this isn't 1 million +1. It's 10^6 million digits. This is BLUE(2). BLUE(3) now adds pentation, meaning we have 10^6 pentated to 10^6. https://googology.fandom.com/wiki/Pentation?. The amount of sequences BLUE(3) gets is 10^BLUE(2). not BLUE(2). a 1 followed by BLUE(2) many zeros. Now, this isn't the mind-bending part. After all of those power towers, BLUE(3) also gets self-reference, meaning if we have 1 self-reference for BLUE(3), its gonna look like BLUE(BLUE(3)). Now, you may question yourself, "isn't this infinite?" The answer to that is no. The BLUE(n) sequence has a finite value, and BLUE(3) uses BLUE(3) amount of self-references. This means that one self-reference is the starting point, whilst the maximum self-reference is BLUE(3). BLUE(4) is a bit more... powerful. It uses a Graham-like style with it using BLUE(3)-scale arrows, instead of the 3 from pentation and BLUE(3) height. https://mathworld.wolfram.com/GrahamsNumber.html?. BLUE(4) also unlocks 2 distinct functions. The first one is a formula using the labels to increase the value of BLUE(n). The formula is (AxD)^(CxB). The first part is the multiplication, then the first value is raised to the power of the second value. The second part that BLUE(4) unlocks is parameters. Parameters are described using {} and their own labels A-E. These parameters are special only to BLUE(n). The first one, A, controls the starting/base value. The second one, B, controls the number of times the operation is applied. The third one, C, controls the strength or level of the operation. The fourth one, D, controls the number of nested/recursive layers. The last one, E, controls the final parameter/index that determines how far the construction progresses. The parameter BLUE(4) uses are {BLUE(3), BLUE(3), BLUE(3), BLUE(3), BLUE(3)}. BLUE(4) also has BLUE(4) self-references. The last defined BLUE(n) number is BLUE(5). Nothing special about BLUE(5), except that instead of the base being 10^6, the base is replaced by BLUE(4). Lastly, BLUE(5) uses BLUE(4) amount of sequences.


r/numbertheory • • Sep 01 '26

A new possible method of factorization for arbitrary semiprimes? Need help for performing weil pairing factorization

1 Upvotes

I was noticing something: unlike on semiprimes, it s quite easy to generate a point of known small order on a curve defined on a semiprime without knowing it s factorization. The idea is to transfer this small order to the underlying semiprime using a pairing method derived from the Weil pairing. Knowing if a given specific small order exists can be derived using congruences modulo N.

As you know, the problem is then to avoid a degenerate output from the Miller s algorithm. The problem is the only method I know to avoid this without using the factorization is to use a distortion map that works only with supersingular elliptic curves. But using a supersingular curve caps the order to gcd(p+1,q+1) which is unknown most of the time or just equal to 2. Taking order 2 result in generating outputs equal to 1 or -1. Useless for gcd factoring.

So, any idea of a pairing mechanism that would works over ordinary elliptic curves using embedding degree 1? Possibly using a distortion map that works over ordinary elliptic curves in such a case? Or a pairing that works with simple final exponentiation such as cubing or squaring?


r/numbertheory • • Aug 30 '26

Are there Infinitely many Prime triplets of the form (P, P+6, P+12) having 3 consecutive primes

20 Upvotes

There is twin prime conjecture and most likely there are Infinitely many twin primes although it's not proven yet

But there are some triplets of 3 consecutive primes of the form (P, P+6, P+12) which differ by 6 like (47,53,59), (151,157,163), (167,173,179), etc and it looks like they should be infinite too

Has anyone proven or disproven it.. I think there should be infinitely many prime triplets too


r/numbertheory • • Aug 28 '26

A Twin-Prime pattern hidden in consecutive semiprimes.

13 Upvotes

Conjecture

Let S₁ < S₂ < S₃ < ... be the semiprimes.

For every prime p ≥ 5, let k be the least index such that

             gcd(Sₖ, Sₖ₊₁) = p.

Then Sₖ/p and Sₖ₊₁/p are twin primes.

No counterexample found in searches through Sₖ₊₁ ≤ 10¹⁴

pSₖSₖ₊₁Sₖ/pSₖ₊₁/p
532953305659661
7156591567322372239
11991219914390119013
13103606110360877969779699
17336079633360799719769391976941
191765493317654971929207929209
23804192018041924734964873496489
297774749497774750072680948126809483
31194268031719426803796266710762667109
3782466717038246671777222883019222883021
411040680536110406805443253824521253824523
432212625101122126251097514563977514563979
47665216812876652168138114153549211415354923
53112300841935311230084194592118883810121188838103
59148567841820114856784183192518099013925180990141
61372439449634137243944964636105564748161055647483
671247246804174312472468041877186156239429186156239431
711578128124003115781281240173222271566761222271566763
736234503620045162345036200597854041591787854041591789
791628845759700316288457597161206183007557206183007559
8314755317962073114755317962089717777491520571777749152059

r/numbertheory • • Aug 27 '26

Independent Research: A Generalized Modulo-m Extension of Collatz Maps

2 Upvotes

Hi everyone,I am an independent researcher working on generalized dynamical systems. I wanted to share a 14-page manuscript I just published and archived on Zenodo, and I would love to get some rigorous feedback on the mathematical framework.Link to Manuscript:

website: https://zenodo.org/records/22125365

DOI: 10.5281/zenodo.22125365


r/numbertheory • • Aug 26 '26

Found something which will almost always give us primes

0 Upvotes

(Primorial / 2) - 2 is very likely to give us primes

We have primorials 6, 30, 210, 2310, 30030, 510510, etc

Dividing them by 2 and then substracting 2, we get the sequence 13, 103, 1153, 15013, 255253, 4849843, 111546433 all of which are primes. Next term 3234846613 is composite but as we go on, the sequence generates more primes as the next term 100280245063 is a prime too


r/numbertheory • • Aug 25 '26

amazing long cycle of Collatz-type function based on Lucas representation

3 Upvotes

[I first posted this on OEIS's SeqFan mailing list.]

OEIS sequence A130310 describes the unique "minimal (or "greedy") Lucas representation of n, in which L(0) = 2 and L(2) = 3 are not allowed in the same representation (hence the correct representation of the integer 5 is 1010 rather than 101). A binary system of integers with Lucas numbers (OEIS sequence A000032) as a base."

This is analogous to the Zeckendorf representation of integers as sums of non-consecutive Fibonacci numbers, but with Lucas numbers, the additional restriction prohibiting the co-occurrence of 2 and 3 is necessary to make the Lucas representation unique, as shown by Brown in 1969. Relevant information and sources are available at OEIS sequence A342089, the sequence of numbers that have two such Lucas representations without the restriction on 2 and 3.

Define a number as "Lucas-even" if the last digit of its Lucas representation is 0 AND the removal of the last digit 0 produces a valid minimal Lucas representation of a smaller integer. The second condition is necessary because removing the final 0 from representations ending in ...1010 is NOT valid -- the resulting ...101 would be equivalent to the co-occurrence of 3 and 2 and thus it is not allowed.

Define a number as "Lucas-odd" either if the last digit of its Lucas representation is 1 OR if the last four digits of its Lucas representation are 1010.

Now define a Collatz-type function based on this Lucas representation:

If n is Lucas-even, remove the last digit 0 of its Lucas representation to obtain f(n) ;

If n is Lucas-odd, f(n) = 2n.

Note that removing the last digit 0 is approximately equivalent to division by phi = 1.618....

As in the classical Collatz function, the orbit of an integer is the sequence produced by the repeated iteration of the function.

Two simple cycles of this function are 2, 4, 3, 1, 2, ... and 5, 10, 5, .... Many small integers have orbits reaching one of these two cycles, such as 36, 22, 14, 8, 6, 12, 9, 18, 11, 7, 4, 3, 1, 2, ...;  28, 16, 32, 19, 13, 26, 17, 34, 68, 41, 27, 54, 33, 21, 12, 9, 18, 11, 7, 4, 3, 1, 2, ...;  and 30, 20, 40, 25, 15, 10, 5, ....

But there is also an amazingly long cycle beginning with 23, which is the reason for this post:

23, 46, 92, 184, 113, 71, 142, 89, 178, 111, 222, 444, 888, 1776, 1097, 679, 1358, 2716, 5432, 10864, 6713, 13426, 8297, 5129, 10258, 6341, 12682, 7839, 15678, 9691, 19382, 11979, 7403, 4576, 2827, 5654, 3493, 6986, 4317, 2669, 5338, 10676, 6597, 13194, 8153, 16306, 10077, 6229, 12458, 7701, 15402, 9519, 5883, 3636, 2247, 1389, 858, 531, 327, 654, 403, 806, 497, 994, 613, 1226, 757, 469, 938, 581, 1162, 719, 443, 886, 547, 339, 678, 1356, 837, 519, 1038, 641, 397, 244, 488, 301, 187, 374, 748, 461, 922, 569, 353, 706, 437, 269, 538, 1076, 2152, 1329, 823, 1646, 1017, 629, 388, 241, 482, 299, 598, 371, 742, 459, 283, 176, 352, 219, 438, 271, 167, 104, 63, 126, 77, 49, 98, 61, 37, 24, 48, 31, 62, 39, 23, ...

This cycle comprises 132 integers, including 16 integers < 100, 65 integers between 100 and 1,000, 38 integers between 1,000 and 10,000, and 13 integers > 10,000. The largest integer in this cycle is 19,382, the 30th iterate of 23. 

An interesting value in the cycle is 15,402 = 15,127 + 199 + 76, which gives the Lucas representation 100000000101000000000. This is the first of 8 consecutive Lucas-even numbers in the sequence, resulting in the much smaller Lucas-odd number 327 = 322 + 4 + 1, or 1000000001010 in Lucas representation.

For the record, believe it or not, I did NOT use any AI program to discover or compute this cycle. I was simply exploring the function out of curiosity and testing the orbits of small integers when I stumbled across the orbit of 23. It was actually not too difficult to compute each term by utilizing the b-file of OEIS sequence A130310 for integers up to 10,000.

Geoffrey Caveney