View Single Post
Old 2020-10-14, 08:54   #32
Alfred
 
Alfred's Avatar
 
May 2013
Germany

1238 Posts
Default

Quote:
Originally Posted by Dr Sardonicus View Post
It is intuitively obvious that, if k is "sufficiently large", the smallest "2-brilliant" number n > 22k is n = p1*p2, where p1 = nextprime(2k) and p2 = nextprime(p1 + 1). Numerical evidence suggests that "sufficiently large" is k > 3. This notion "obviously" applies to any base.
Dr Sardonicus,

does this statement apply to largest 2-brilliant numbers in base 10?

If yes, please give an example.
Alfred is offline   Reply With Quote