Problems & Puzzles: Puzzles

 

 

Problems & Puzzles: Puzzles

Puzzle 1284 The Right-Crescendo Serpent

On September 27, 2026, my friend G. L. Honaker, Jr., sent the following puzzle.

But first, here are some historical notes:

a) The core ideas in this puzzle goes back to 2005, when Amarnath Murthy published the sequence https://oeis.org/A110764
b) More recently G. L. Honaker, Jr. in 2016 published this Curio, corresponding to a 75 digits prime obtained as a result of this sequence.
c) Michael Branicky extended this sequence of digits from 71 to 85 in 2021

Anyhow, here goes the puzzle:

Starting with any chosen digit (1-9) as N, "Concatenate the first n digits of this number N where the next digit equals the number of distinct prime factors the number contains".

This is the same than N = N*10+QDPF(N), QDPF = "Quantity of Distinct Prime Factors"

By definition the next digit can be only an integer between 0 to 9.

For example: if the chosen first digit k is "1", then first 75 digits-number of the "Serpent-1" is this one :

102332234332543254432554756323145363256462444734575376546347484633443327927...

because:

1 -> 0
10 -> 2
102 -> 3
and so on...

Incidentally, the 75-digit number shown above is a prime number. The same occurred when the Serpent-1 was 102332234332543254432554756323. For the purpose of this puzzle there is nothing special because the Serpent becomes a prime number. It simply means that the following digit is "1".

According to the definition of the growth of this kind of numbers, its growth will end if the factorization of N reaches to a QDPF>9.

Carlos Rivera has found that this Serpent-1 cannot be larger than this number:

1023322343325432544325547563231453632564624447345753765463474846334433279271327473467566674355 (94 digits), because this number has 10 distinct prime factors.

Here are the Largest Serpent-k for K=1,2,4,5,6,7,9.


Starting
digit, k

Largest Right-k-Serpent, and digits
1 102332234332543254432554756323145363256462444734575376546347484633443327927132
7473467566674355 (94)
2 212223423223325645533283465474656566653445654682734728566554643545974785546466 (78)
4 4112232431234254334546655672647444654665446544755546676632695466746667 (70)
5 512124333323255345465454846545546646732356465434673355768557794745684 (69)
6 62224245424554444944345313435553447955354344468565483384647455545375334575844 (77)
7 7112322532431245442445436314543269536658746334456534784675758835664687358555 (76)
9 9123223264544454533223454453455854654256444665 (46)


It is reasonable to expect that something similar will occur with k=3 & 8.

Q. Can you get the maximum value for 3-Serpent and 8-Serpent?



 




From oct 10 to 16, contributions came from Michael Branicky, Jeff Heleen, Gennady Gusev

***
Michael wrote:
I confirm the largest right-k-Serpents for k = 1, 2, 4, 5, 6, 7, and 9.

For k = 3 and 8, the largest right-k-serpents are each larger than:
311132226354434444546544462524323343353455674544734647568654584677455666445747864593585455676836549576587... (105, unfinished)
81111322333133243255454864554374552755664454314744955445754768445549256765668755492646347543446579778... (101, unfinished)

***
Jeff wrote:
For 3-Serpent I got:
31113222635443444454654446252432334335345567454473464756865458467745566644574786459358545567683654957658757862754689878  (119 digits, 10 distinct factors)
 
For 8-Serpent I got:
81111322333133243255454864554374552755664454314744955445754768445549256765668755496784698367565874534584674457553496446865654884634 (131 digits, 10 distinct factors)

***

Gennady wrote:

The largest numbers starting with 3 and 8, each having 10 different prime factors, have been found: 

3111322263544344445465444625243233433534556745447346475686545846774556664457478645935854556768365495765874748776367646566484765536745968456798855(145digits)

=5×13×47×109×8266751×8961041×57572839×710060783×308172249793×10011686952922652510143493251954557858518867055200659873852603665844522167852948048792660505521259(98digits)

811113223331332432554548645543745527556644543147449554457547684455492567656687553467833453648647677445357874364738677735(120digits)

=5×131×181×1049×16547×449941×34853956094457413×8403242264101322897267×148330409402240138830699597×20164252305318897985766503440449387777(38digits)

***

On Oct 16, Michael Branicky wrote:

Notes:

(A) Gennady's 8-Serpent has an error in digit 81.
It matches Michael's and Jeff's up to 80 digits, but differs in the 81st digit:811113223331332432554548645543745527556644543147449554457547684455492567656687554 (81 digits from Michael)811113223331332432554548645543745527556644543147449554457547684455492567656687554 (81 digits from Jeff)811113223331332432554548645543745527556644543147449554457547684455492567656687553 (81 digits from Gennady)
But 81111322333133243255454864554374552755664454314744955445754768445549256765668755 = 5 * 23 * 8851640633330899309 * 79681934185082159279363171690855430966563040614953720167493So, the next correct digit is 4, not 3.

(B) Jeff's 8-Serpent has an error in digit 83.
It matches Michael's up to 82 digits, but differs in the 83rd digit:81111322333133243255454864554374552755664454314744955445754768445549256765668755492 (83 digits from Michael)81111322333133243255454864554374552755664454314744955445754768445549256765668755496 (83 digits from Jeff)
But 8111132233313324325545486455437455275566445431474495544575476844554925676566875549 = 18127321834867213832060628712397069 * 447453424571073157157615378026672167362401075921So, the next correct digit is 2, not 6.

(C) Jeff's and Gennady's 3-serpents match Michael's for his full 105 digits. But Jeff's continues with a 4 and Gennady's with a 5, so one must be in error.


***
On Oct 17, Giorgios Kalogeropoulos wrote:

I got my results for 3-Serpent one day later and since they are different from the published solutions, I am posting my 3-Serpent and also the key factorizations in a file

3111322263544344445465444625243233433534556745447346475686545846774556664457478645935854556768365495765874748776367646566484746824567464955 (139 digits)

Serpent3FinalFactorization = {{5, 1}, {7, 2}, {19, 1}, {29, 2}, {31, 1}, {1093, 1}, {36761, 1}, {4765877983, 1}, {1849909220458777, 1}, {158668993658101079810091082186500959890297, 1}, {456115403743376119143571818938299359199863562960858369921, 1}} (11 prime factors)

This number disagrees with Gennady's solutions at the bold digits

The disagreement is at the following 125-digit integer
31113222635443444454654446252432334335345567454473464756865458467745566644574786459358545567683654957658747487763676465664847 
I get the following factorization 
7, 23, 135772778951900518081691817962424950561641, 1423332655673725123792161540812215075669344107152733013302727939108293725338647447
So, the next digit is 4.

Also, my final result for 8-Serpent is
811113223331332432554548645543745527556644543147449554457547684455492567656687554926463475434465797785866886777845 (114 digits)
(again the bold digits are the disagreement with Gennady's result)

This factors to 
serpent8FinalFactorization = {{5, 1}, {11, 1}, {89, 1}, {113, 1}, {199, 1}, {313, 1}, {4550219, 1}, {606814199959523, 1}, {2308543582165563025409089, 1}, {3693404002984427436905063711946623602431386060892021771317, 1}} (10 prime factors)
All the difficult factorizations are included in attached file


***
On Oct 22, Gennady Gusev wrote:
Given that the participants did not arrive at exactly the same solutions, I analyzed them.
I designated:
M - Michael
J - Jeff
G - Gennady
For numbers starting with 3:
M-311132226354434444546544462524323343353455674544734647568654584677455666445747864593585455676836549576587 (unfinished).
J-31113222635443444454654446252432334335345567454473464756865458467745566644574786459358545567683654957658757862754689878
G-3111322263544344445465444625243233433534556745447346475686545846774556664457478645935854556768365495765874748776367646566484765536745968456798855
 
As indicated in the color above, the solutions differ for J and G in the 106th digit (the first 105 digits are the same for all three).
G’s correct answer: 4 divisors —
P1 = 3^2
P3 = 103
P45 = 240673235948648104688738704113445978596057833
P58 = 1394560838121703119941464614925163781544039132845730455757
I checked the other characters further and found an error in G's solution in the 126th digit:
311132226354434444546544462524323343353455674544734647568654584677455666445747864593585455676836549576587474877636764656648476
 
The correct solution is:
31113222635443444454654446252432334335345567454473464756865458467745566644574786459358545567683654957658747487763676465664847466645465648545465648756 (147 digits)
 
For numbers starting with 8:
M-811113223331332432555454864554374552755664454314744955445754768445549256765668755492646347543446579778 (unfinished).
J-811113223331332432555454864554374552755664454314744955445754768445549256765668755496784698367565874534584674457553496446865654884634 (131 digits, 10 distinct factors)
G-811113223331332432554548645543745527556644543147449554457547684455492567656687553467833453648647677445357874364738677735
M has all the correct digit.
J has an error in the 83rd digit.
G has an error in the 81st digit. 
The correct solution is: 
811113223331332432554548645543745527556644543147449554457547684455492567656687554926463475434465797785866886777845 (114 digits).


***

On Oct 22 Carlos Rivera wrote:

Here are my resuls:

3111322263544344445465444625243233433534556745447346475686545846774556664457478645935854556768365495765874748776367646566484746824567464955 (139 CR)
811113223331332432554548645543745527556644543147449554457547684455492567656687554926463475434465797785866886777845 (114, CR)

In complete agreement with the Giorgos resuts.

***
On Oct23, 2026 Oscar Volpatti wrote:

About puzzle 1284, I was surprised to notice that submitted solutions were not matching.
I decided to double-check them and I came up with a new candidate maximal 8-serpent:
811113223331332432554548645543745527556644543147449554457547684455492567656687554926463475434465797785866886777845 (114 digits, 10 distinct factors).

Right-3-Serpent
All submitted solutions are matching up to serpent s105, where Michael Branicky's unfinished solution stops.
Then d106 = 5 for Jeff Heleen and d106 = 4 for Gennady Gusev.
s105 = 3^2 * 103 * 240673235948648104688738704113445978596057833 * 1394560838121703119941464614925163781544039132845730455757,
hence d106 = 4 (distinct prime factors),  matching GG's solution.
I confirmed GG's solution up to serpent s118, whose factorization exceeds the capabilities of my machine.

Right-8-Serpent
All submitted solutions are matching only up to serpent s80.
s80 = 81111322333133243255454864554374552755664454314744955445754768445549256765668755,
s80 = 5 * 23 * 8851640633330899309 * 79681934185082159279363171690855430966563040614953720167493,
d81 = 4,
s81 = 2 * 11 * 19 * 41 * 4649 * 217849 * 4768349 * 3163989234146866289293 * 3097442084994588525881543920979145661969,
d82 = 9,
s82 = 18127321834867213832060628712397069 * 447453424571073157157615378026672167362401075921
d83 = 2.
Digit sequence "492" matches Michael Branicky's solution.
I confirmed MB's unfinished solution and extended it to serpent s114, which is maximal.
s114 = 811113223331332432554548645543745527556644543147449554457547684455492567656687554926463475434465797785866886777845,
s114 = 5 * 11 * 89 * 113 * 199 * 313 * 4550219 * 606814199959523 * 2308543582165563025409089 * 3693404002984427436905063711946623602431386060892021771317.

***
On Oct 24, 2026, Genady Gusev wrote:

For 3-Serpent an error has crept into my solution again.
I confirm Carlos’s and Giorgios's solution.

***



Records   |  Conjectures  |  Problems  |  Puzzles