Go Back > Fun Stuff > Puzzles

Thread Tools
Old 2021-09-27, 14:26   #1
Dr Sardonicus
Dr Sardonicus's Avatar
Feb 2017

53·41 Posts
Default Proper factorization known, no prime factors known

This is merely recreational mathematics. If this more properly fits in an area other than "Puzzles," feel free to move it there.

My "jumping off place" is the fact that (currently, AFAIK) the character (prime or composite) of F33 is unknown.

The Prime factors k*2n + 1 of Fermat numbers Fm and complete factoring status page lists Fm for the values m = 33, 34, 35, 41, 44, 45, 46, 47, 49, 50, 51, . . . as "Character unknown."

So it occurred to me that there are numbers with known proper factorizations, for which the "minimal" proper factors (those which are not the product of smaller known proper factors) are all of unknown character. A trivial example would be N = F33*F33.

Of course, one can cobble together other such trivial examples by tracking down numbers of unknown character and multiplying them together.

It occurred to me that one could probably construct "more natural" examples using algebraic factorizations. As a potential example, I give the number N = googolplex + 1 = 1010^100 + 1. We have


According to Prime factors of generalized Fermat numbers Fm(10) and complete factoring status, F100(10) appears to be of unknown character [though two prime factors are known for F99(10)], so the first factor at least is of unknown character. I'm guessing nobody has tried to find factors of the other algebraic factors, but I don't know. I am not suggesting that anybody waste their time looking for them.

I imagine much smaller examples are to be found; a possible candidate is 23*2^33 + 1. But for all I know, someone may have found a divisor of the larger algebraic factor.

I don't know whether there's a number of unknown character smaller than F33. Anybody?

Last fiddled with by Dr Sardonicus on 2021-09-27 at 14:31 Reason: insert missing multiplication symbol
Dr Sardonicus is offline   Reply With Quote
Old 2021-09-27, 16:17   #2
Stargate38's Avatar
"Daniel Jackson"
May 2011

677 Posts

In terms of smaller numbers, there's M1347826279*M1552958761 (I TF'd both of them to make sure there were no small factors <10^21), but there's also some larger examples, such as MM61*MM89*MM107*MM127*MM521*MM607*...*MM82589933*..., going on as far as there are Mersenne Prime exponents to use, assuming that there are finitely many Mersenne primes (otherwise the resulting number is infinite). (2^2^((Loader's Number)↑↑↑...↑↑↑Loader's Number)+1)^2 (where the number of up arrows is Loader's number) is about as big as I can think of, and it's the square of a Fermat number, albeit a gargantuan one.

Last fiddled with by Stargate38 on 2021-09-27 at 16:25
Stargate38 is offline   Reply With Quote
Old 2021-09-27, 16:56   #3
Dr Sardonicus
Dr Sardonicus's Avatar
Feb 2017

10100000001012 Posts

D'oh! Of course! 233 is 8589934592, or almost 8.6 billion! There are plenty of Mp whose character (prime or composite) is unknown, with p < 233. This is likely to remain true for some time to come.
Dr Sardonicus is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
partial exploration into proper divisors MattcAnderson MattcAnderson 0 2021-06-10 05:45
How does proper government manifest in regulation? cheesehead Soap Box 10 2011-04-17 02:29
prime factorization algorithms? MathBoy Math 55 2011-02-11 21:06
What is the proper way to benchmark 2 cores? BlueCatZ1 Hardware 0 2006-08-15 18:08
Random numbers and proper factors mfgoode Math 20 2006-02-05 02:09

All times are UTC. The time now is 06:53.

Wed Dec 1 06:53:25 UTC 2021 up 131 days, 1:22, 1 user, load averages: 1.44, 1.39, 1.29

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.