Skip to content

About http://myfactors.mooo.com/ #1

@xayahrainie4793

Description

@xayahrainie4793

I found that in the "Single Factorization" in http://myfactorcollection.mooo.com:8090/dbio.html, the limit of the exponents of all bases 11<=b<=99 (including perfect power bases b) are all 100000, but the limit of the exponents of bases b = 4, 8, 9 are only 10000 (just like the limit of the bases b>=100), this is not reasonable, since if b1 < b2, then the limit of the exponents of base b1 should be >= the limit of the exponents of base b2, suggestions:

b = 4, limit of the exponent = 600000 (just like b = 3, in fact, limit of the exponent of b = 4 can be 1000000 since limit of the exponent of b = 2 is 2000000, but limit of the exponent of b = 4 should be <= limit of the exponent of b = 3, thus choose the same limit as b = 3)

b = 8, limit of the exponent = 400000 (just like 5 <= b <= 7, in fact, limit of the exponent of b = 8 can be 666666 since limit of the exponent of b = 2 is 2000000, but limit of the exponent of b = 8 should be <= limit of the exponent of 5 <= b <= 7, thus choose the same limit as 5 <= b <= 7)

b = 9, limit of the exponent = 300000, since limit of the exponent of b = 3 is 600000, thus limit of the exponent of b = 9 cannot be > 300000, although 5 <= b <= 7 has limit of the exponent = 400000

b = 100, limit of the exponent = 100000 (just like 11 <= b <= 99, in fact, limit of the exponent of b = 100 can be 150000 since limit of the exponent of b = 10 is 300000, but limit of the exponent of b = 100 should be <= limit of the exponent of 11 <= b <= 99, thus choose the same limit as 11 <= b <= 99)

Also, I found a bug: The prime factors of b^n+1 cannot be reported if they are not primitive prime factors, only the prime factors of b^n-1 can be reported if they are not primitive prime factors, please fix this bug

Also, the "Algebraic Factors for a^n+-1" in http://myfactorcollection.mooo.com:8090/calculators.html, if a and n are both > 20K, it should print "for base > 20K, exponent must be <= 20K. Try again." instead of "for base > 20K, exponent must be < 20K. Try again.", please fix it

Also, the "Factorizations" in http://myfactorcollection.mooo.com:8090/dbio.html, if I choose "from base 11 to base 99", then the limit of exponent will be 100000, but if I choose "from base 10 to base 99" or "from base 2 to base 99" then the limit of exponent will be only 10000, this is also not reasonable, suggestion: the limit of exponent of the list of "from base b1 to base b2" (b2 >= b1) can be the same as the limit of exponent of base b2

Also, for the "First Holes" in http://myfactorcollection.mooo.com:8090/dbio.html, I suggest not to skip perfect power bases b (I think that it is possible, you can convert the perfect power bases b and found the smallest exponent n such that b^n+-1 is not fully factored)

e.g.

2^1207 - 1 131071.228479.48544121.212885833.C337
2^1129 + 1 3.5297035427.C330
3^703 - 1 2.1597.363889.388057.1923409.13097927.444045733.17189128703.62000138226054796871.C269
3^692 + 1 2.41.9114428881.1011341176318148603849.1518049147161649877849.C277
4^1129 - 1 (2^2258 - 1) 3.33871.833798113.5297035427.P139.P188.C330
4^584 + 1 (2^1168 + 1) 4673.65537.1137948235396559809.C326
5^503 - 1 22.30181.390543339331.3447076237287135944677009.P52.C260
5^478 + 1 2.13.267916133.96213845302733.C311
6^431 - 1 5.863.529445577173.C321
6^431 + 1 7.7759.C331
7^421 - 1 2.3.120298224779693.1169407471026387018305554817094515359.C305
7^397 + 1 23.1735830097.2561457623453.70258473243281.C300
8^501 - 1 (2^1503 - 1) 7.73.2349023.2175904570897.4385385156782532979801.1005585368191728927640111.25129004796912072003423103.939803771633772956193641134351.79638304766856507377778616296087448490695649.P75.C212
8^503 + 1 (2^1509 + 1) 32.3019.20127043.3037277959210939.73160915304450017870491968721.P55.P97.C248
9^692 - 1 (3^1384 - 1) 25.5.41.347.762239.993367.14427163.9114428881.2125048865543.3841314164761.125330011023211.3435486499404173.156026417563831897.1011341176318148603849.1518049147161649877849.267002863306984445333758842608816261.31072285114904997233712868061148862483.76559776114775888306749338768040651509417955829.P54.P62.C277
9^346 + 1 (3^692 + 1) 2.41.9114428881.1011341176318148603849.1518049147161649877849.C277
10^353 - 1 32.1781225293.1044667255801249.C328
10^332 + 1 73.137.1993.1627839311921131673455277189737.C295
11^331 - 1 2.5.C344
11^326 + 1 2.61.16301.C334
12^311 - 1 11.C335
12^307 + 1 13.14737.116171257.422403014624473.C304
13^241 - 1 22.3.1447.35217562019375387102779.C242
13^229 + 1 2.7.528991.C249
14^223 - 1 13.139742059.C247
14^223 + 1 3.5.435931044288729061754894879.C228
15^227 - 1 2.7.958849.3501703.C254
15^218 + 1 2.113.5669.55037834777.2103082538500878847141406285492297.C207
16^584 - 1 (2^2336 - 1) 3.5.17.257.293.439.1753.4673.9929.65537.2298041.9361973132609.649301712182209.1137948235396559809.1795918038741070627.19602880710043505617.32871186029052837857.9444732965601851473921.79778881726281213651073.P68.P131.C326
16^292 + 1 (2^1168 + 1) 4673.65537.1137948235396559809.C326
17^233 - 1 24.467.289532440255529181466847889468166042619.C245
17^212 + 1 2.41761.84377.4765055630849.C239
18^223 - 1 17.C279
18^211 + 1 19.271611017.24220605179.335946629853426569.C228
19^223 - 1 2.32.2677.3705121363.7579985624053.C259
19^202 + 1 2.181.21817.C252
20^197 - 1 19.1314779.106562961720350371.C232
20^197 + 1 3.7.3547.456647.C246

Also, "Top 123 brilliant (number of digits is equal) penultimate,ultimate pairs" in http://myfactorcollection.mooo.com:8090/ruminations.html, you already have a list sorted by the ratio of these two prime factors, suggest to add another list sorted by the penultimate prime factors themselves (just like https://stdkmd.net/nrr/records.htm#nicesplit), also, you can show the first 10 digits and the last 10 digits (instead of the first 5 digits and the last 6 digits) of the prime factors like https://stdkmd.net/nrr/records.htm, you can also show 10 significant digits of the ratio of these two prime factors

Activity

xayahrainie4793

xayahrainie4793 commented on Jun 21, 2025

@xayahrainie4793
Author

"Factorizations -- Raw Table Data (Primitive Factors Only)" should also support "Expanded", “Only Table Entries”, "Prime bases", "Prime exponents" options, like the "Single Factorization" table and the "Factorizations" table

In the "composite lists" pages in http://myfactorcollection.mooo.com:8090/lists.html, suggest to write (b^n+1) instead of (b^(2*n)-1)/(b^n-1), for example, “((13^229+1)*(13^2+1))/528991” instead of “(((13^458-1)*(13-1))/((13^229-1)*(13^2-1)))/528991” for 13,229+

In the "Single Factorization" in http://myfactorcollection.mooo.com:8090/dbio.html, it will not have "Submit Factors?" if the number has an Aurifeuillian LM factorization and we choose "Separate L,M's"

In the "algebraic factors of a^n+-1" in http://myfactorcollection.mooo.com:8090/calculators.html, suggest to write the Aurifeuillian LM primitive numbers as (for example) "Φ_30L(3)" instead of "L'_15" like https://stdkmd.net/nrr/repunit/phin10.htm#N20L

In the "Aurifeuillian LMs" and "Primitive(s)" in http://myfactorcollection.mooo.com:8090/calculators.html, suggest to write "Base is a perfect power. Converting base from xxx to xxx and exponent from xxx to xxx." like the ".poly Maker" in http://myfactorcollection.mooo.com:8090/calculators.html and the "Single Factorization" in http://myfactorcollection.mooo.com:8090/dbio.html

In the "Quick Search -- Composites" in http://myfactorcollection.mooo.com:8090/dbio.html, suggest to also support perfect power bases like the ".poly Maker" in http://myfactorcollection.mooo.com:8090/calculators.html and the "Single Factorization" in http://myfactorcollection.mooo.com:8090/dbio.html, e.g. the composite cofactor of 3^692+1 can be searched if use base = 9, exponent = 346, +/-/L/M/LM/blank = +, also suggest to write "Base is a perfect power. Converting base from xxx to xxx and exponent from xxx to xxx." like the ".poly Maker" in http://myfactorcollection.mooo.com:8090/calculators.html and the "Single Factorization" in http://myfactorcollection.mooo.com:8090/dbio.html

In the ".poly Maker" in http://myfactorcollection.mooo.com:8090/calculators.html (choose "All Candidates"), it writes "# Exponent is divisible by 5. Quartic computed.", "# Exponent is divisible by 7. Sextic computed.", "# Exponent is divisible by 11. Quintic computed.", "# Exponent is divisible by 13. Sextic Computed.", etc. for the exponents divisible by 5, 7, 11, 13, etc. but it does not write "# Exponent is divisible by 17. Octic computed." for the exponents divisible by 17, could you add it? Thanks. Also, for the Aurifeuillian LM numbers for bases b whose squarefree part is <= 17 or = 21, it writes "# (b)LM" (the Aurifeuillian LM numbers for base b can be used for computing SNFS polynomials if and only if the squarefree part of b is <= 17 or = 21 or = 30), but it does not write it for bases b whose squarefree part is 30, could you add it? Thanks. Also, for the exponents not divisible by any odd prime <= 17, it just writes "# Exponent is not divisible by anything interesting. Had to add and/or subtract from it.", could you change the texts to "# Exponent is not divisible by any odd prime <= 17. Had to add and/or subtract from it."? Thanks.

I found that for the even exponents and minus 1's, the boxes in http://myfactorcollection.mooo.com:8090/dbio.html (except "Single Factorization" and "Factorizations") ignore, and the page http://myfactorcollection.mooo.com:8090/interactive.html also ignores, and the box ".poly Maker" in http://myfactorcollection.mooo.com:8090/calculators.html also ignores, but the box "Primitive(s)" in http://myfactorcollection.mooo.com:8090/calculators.html does not ignore (the primitive should be 1 if ignores), these lose consistency (also, for the box "Primitive(s)" in http://myfactorcollection.mooo.com:8090/calculators.html, it gives the Aurifeuillian LM primitives for 2^n+1 with n == 2 mod 4 and 3^n+1 with n == 3 mod 6, etc. but does not give the Aurifeuillian LM primitives (only gives the cyclotomic primitives) for 2^n-1 with n == 4 mod 8 and 3^n-1 with n == 6 mod 12, etc.)

In the "Lucas C,D polynomials" in http://myfactorcollection.mooo.com:8090/dbio.html, if the base is not squarefree, it should write "Base must be squarefree" instead of "Record not found." (also, in the page itself, suggest to write "( 2 - 20999, squarefree )" instead of just "( 2 - 20999 )" for Base)

Suggest to add "First Holes for exponents" like "First Holes" in http://myfactorcollection.mooo.com:8090/dbio.html, but for fixed exponent instead of fixed bases (e.g. the first hole for b^53+1 is 1002^53+1), also do not skip perfect power bases

(I think that only the composite lists in http://myfactorcollection.mooo.com:8090/lists.html and the "Factorizations -- Raw Table Data (Primitive Factors Only)" in http://myfactorcollection.mooo.com:8090/dbio.html (since this is the raw table data) and "Factorizations -- (a^n size) Custom Sets" in http://myfactorcollection.mooo.com:8090/dbio.html (since this is the extension of Brent's table) and the list in http://myfactorcollection.mooo.com:8090/interactive.html should skip perfect power bases, all others should not skip perfect power bases)

The base limits of "comps(2,3,4,5).gz" in "Lowest Unfinished Exponents" in http://myfactorcollection.mooo.com:8090/downloads.html should be 999, 9999, 19999, 99999 instead of 1000, 10000, 20000, 100000 (I found that base 20000 is not included in "comps4.gz", since 20000^31-1 is not fully factored, but the "Lowest Unfinished Exponents" of "comps4.gz" is 34, also it seems that perfect power bases are skipped in "comps(2,3,4,5).gz", but I do not think that there are any perfect power bases in the corresponding ranges with smaller unfinished exponents)

Could you extend the "opfactors.bf.gz" file in http://myfactorcollection.mooo.com:8090/downloads.html from p^q < 10^850 to p^q < 10^1000? Also please show the limit of the bases and the exponents of the other files in http://myfactorcollection.mooo.com:8090/downloads.html (e.g. LittleBrent.pdy.gz: 13 <= b <= 99, b not perfect power, b^n < 10^255; factors.gz and newfactors.gz: b <= 9999, b not perfect power (this is necessary, since 4^n, 9^n, 25^n, 36^n for n > 5000 are not included in the files, 8^n, 27^n for n > 3333 are not included in the files, 16^n for n > 2500 are not included in the files, 32^n for n > 2000 are not included in the files, etc.), n <= 10000; studiokamada.bf.gz: n <= 300000 for the -1 side, n <= 150000 for the +1 side; gimps.bf.gz: n <= 2000000; etc.), thanks.

JonathanCrombie

JonathanCrombie commented on Aug 15, 2025

@JonathanCrombie
Owner

There has been a change of direction for the cownoise website. Primarily the focus will be on entertainment value and any useful/serious work will just be incidental. Any comments on increasing the entertainment value will be much appreciated.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

      Development

      No branches or pull requests

        Participants

        @JonathanCrombie@xayahrainie4793

        Issue actions

          About http://myfactors.mooo.com/ · Issue #1 · JonathanCrombie/Cowcave