View Single Post
Old 2017-10-14, 02:10   #2
science_man_88's Avatar
"Forget I exist"
Jul 2009

26×131 Posts

Originally Posted by ThomRuley View Post
I've been reading a couple of papers lately about the OPN problem. I understand how proof trees work, but I still have a question about the more detailed parts of it. I notice that Brent et al had a list of forbidden factors, as do Ochem and Rao.

Brent et al

Ochem and Rao

I still don't understand why were "forbidden" in the proof trees. Is it similar to Kishore 1983, where an OPN not divisible by 3 has more prime factors?

Thanks links to the paper I think you are reading, and gives one example, that I can't quite get my head around.
science_man_88 is offline   Reply With Quote