Interviews: Ask Mathematician Neil Sloane a Question
Considered by many to be one of the most influential mathematicians alive today, Neil Sloane has made major contributions to the fields of sphere packing, combinatorics, and error-correcting codes. He is probably best known for being the creator and curator of the On-Line Encyclopedia of Integer Sequences (OEIS), known simply as “Sloane” by its many users. The repository is over 50 years old and contains over 260,000 sequences.
Neil recently turned 76 but his passion for mathematics remains as strong as ever. Talking about a recent project, he writes: “Back in September I was looking at an old sequence in the OEIS. The sequence starts 1, 12, 123, 1234, 12345, ..., 123456789, 12345678910, 1234567891011, ... The n-th term: just write all the decimal numbers from 1 to n in a row and think of this as a big number. The entry for the sequence had a comment that it is expected that there are infinitely many terms which are primes, but that no prime was known, even though Dana Jaconsen had checked the first 64,000 terms. So I asked various friends and correspondents about this, and people extended the search somewhat. In fact Ernst Mayer has set up a cloud-source project to look for primes in the sequence, and the sequence has now been checked to nearly n = 270,000 without finding a prime. But I am hopeful that a prime will appear before we get to n = 10^6. When a prime is found, as it surely will be, it probably won't be the largest prime known, but it will be close to the record (which is held by the latest Mersenne prime). We may make it into the top ten. It will certainly be the largest known prime which is easy to write down! (Explicitly, I mean. You may know that 2^32582657-1 is prime, but you won't be able to write down the decimal expansion without using a computer).”
Neil has agreed to take some time away from his favorite sequences and answer any questions you may have. As usual, ask as many as you'd like, but please, one question per post.
Neil recently turned 76 but his passion for mathematics remains as strong as ever. Talking about a recent project, he writes: “Back in September I was looking at an old sequence in the OEIS. The sequence starts 1, 12, 123, 1234, 12345, ..., 123456789, 12345678910, 1234567891011, ... The n-th term: just write all the decimal numbers from 1 to n in a row and think of this as a big number. The entry for the sequence had a comment that it is expected that there are infinitely many terms which are primes, but that no prime was known, even though Dana Jaconsen had checked the first 64,000 terms. So I asked various friends and correspondents about this, and people extended the search somewhat. In fact Ernst Mayer has set up a cloud-source project to look for primes in the sequence, and the sequence has now been checked to nearly n = 270,000 without finding a prime. But I am hopeful that a prime will appear before we get to n = 10^6. When a prime is found, as it surely will be, it probably won't be the largest prime known, but it will be close to the record (which is held by the latest Mersenne prime). We may make it into the top ten. It will certainly be the largest known prime which is easy to write down! (Explicitly, I mean. You may know that 2^32582657-1 is prime, but you won't be able to write down the decimal expansion without using a computer).”
Neil has agreed to take some time away from his favorite sequences and answer any questions you may have. As usual, ask as many as you'd like, but please, one question per post.
What should I learn from the area of mathematics if you assume that time is limited?
Rhetorical: is there anybody less interested in political power than a mathematician?
Should we try to get away from so many lawyers and doctors in political office, and try to bring in some (arguably) more thoughtful people, or would this merely succeed in upsetting everyone?
Get thee glass eyes, and, like a scurvy politician, seem to see things thou dost not.--King Lear
Is the use of prime factorization as the basis for public key cryptography still considered to be safe against attacks, given advances in number theory and Moore's Law since the '70s?
Are alternative schemes (e.g., Merkle's knapsack packing) under active consideration?
It would strike me that a brute-force approach is pretty poor for this.
As the digits of the sequences are well-known and predictable, some ancient mathematical tricks (e.g. if the digits sum to a multiple of three, etc.) and a bit of algebra on the base-10 expression should surely yield more convincing proof one way or another than anything else, certainly if you'd got as far as they have by brute-force.
Anything ending is 2,4,5,6,8 or 0 is gone immediately as non-prime. Three, sixes and nines have rules similar to the above that operate on the digits of base-10 expression. It would seem to rule out vast swathes of such numbers. Past that, there's not much left to check at all.
But because the sequence is highly predictable and can only end in so many things, you're quickly only looking at massively large numbers as factors to see if they "hit".
In other words, is mathematics a fundamental part of the fabric of reality (i.e. Platonism)? And are concepts like zero, infinity, imaginary numbers, and so on, actually real objects? Or do you think mathematics is mostly a tool created by humans out of convenience (akin to language), and numbers and other concepts are just abstract ideas in our brains?
I am intrigued by how some people ( especially Americans) speak numbers after decimal
For example 10.16 will be spoken as ten dot sixteen as opposed to 10 point one six
To me the American way seems odd as the numbers after decimal are not whole numbers and should not be spoken as such.
So, is there a canonical way to speak numbers?
"We may make it into the top ten. It will certainly be the largest known prime which is easy to write down!"
I literally LOL at this and now there's coffee in my keyboard and I need to explain a maths joke to my co-workers.
There are infinitely many primes, so why is there a quest to identity larger and largert prime, like you are trying to do here. The
Mersenne formula is good for cryptographic use, so why bother
Is this just a mundane curiosity or does it have something more to it?
Can you give me a hand with my son's math homework?
One of the common problems with any field of science or math is how hard it is for outsiders to understand what's going on inside. What sort of challenging problems, profound conjectures, sublime proofs, or versatile tools and applications do you feel languish in obscurity or are greatly underappreciated by either the layman and/or a knowledgeable mathematician outside your field(s) of interest?
Would you be so kind as to explain or summarize the connection between hyper-dimensional sphere packing and error-correcting codes?
The Mathmagician is the most computational local wrestler in sports entertainment today. Unfortunately, he loses a lot. What integer sequence should he study to win his next match?
I had a college instructor who retired from teaching mathematics at 81. Why that age? Because it was nine squared. I think he was 89 (a prime number) when he keeled over.
Looks like two primes are known when you do reverse concatenation of the first a(n) integers. If you concatenate 37765, 37764, 37763, ..., 3, 2, 1, then you get a prime.
Do you think that the concept of life can be defined mathematically?
For example, certain states of dynamical systems could be defined as 'alive' if they
reproduce and evolve, where reproduction and evolution would have to be defined as well,
of course.
Then, we could go on and look for criteria for dynamical systems that
would imply that life can or must exist. Or prove that the probability
of a system to be alive is nonzero if parameters are chosen randomly. Etc. etc.
Why is the square root of -1 so provocative?
Why would raping eliminate anyone? Can't you formulate racist troll posts that make at least some minimal sense?
What is your motivation?
Too slow
Why are you so certain that that sequence contains any primes at all?
Considering the sequence of infinite numbers: 2, 22, 222, 2222 etc. it contains only one prime and 4, 44, 444, etc. none at all.
Cost free eBook I read (by iBook/Kobo/Amazon/ObookO/Gutenberg etc.): "The Green Odyssey" by Philip Jose Farmer.
Do you prefer basalt or granite? Why?
Was it common knowledge that Alan Turing was homosexual? Did you ever think he was in the wrong for being that way inclined?
why havn't you released the theory of Psychohistory
If so, why? I'm curious.
Some of the sequences being studied (like the example in the summary) use formulations developed from base 10 numbers. Have you explored other bases, in particular prime number bases, or perhaps a rational fraction or even irrational/transcendent number? If so, were there any interesting surprises?
"Who are you?" "No one of consequence." "I must know." "Get used to disappointment."
If it wasn't for prime numbers we would be immortal!
At 76, you'll probably drop dead any day now. What's that like? I don't care about number patterns, so we have nothing else to talk about.
Comments like this are the primary reason I read ./ these days.
Thank you, Anonymous Coward.
1
12 - any number that ends on a multiple of 2 is an even number and hence can't be prime
123 - any number whose sum of digits is divisible by 3 is not a prime
1234 - covered in 12 above
12345 - any number whose last digit is a 5 (or 0) is evenly divisible by and hence can't be a prime
123456 - covered in 12 and 123 above
1234567 - the first possible candidate not immediately eliminatable based on consistuent digits
12345678 - covered in 12
123456789 - covered in 123 above
1234567890 - covered in 12 and 12345 above
Now we start adding the same sequence back
12345678901 - second possible candidate
same rules eliminate all of these up to
12345678901234567
Which means out of each ten digits there are only two candidates for primes - a number ending in 1 or a number ending in 7.
Except that every 3 1-0s they can be eliminated as a multiple of 3
Every 5 1-0s they can be eliminated as a multiple of 5
Every 6 1-0s they can be eliminated as per 3 1-0s above
Every 9 1-0s they can be eliminated as per 3 1-0s above
So while ostensibly there are potentially 20% primes in the 1-0 sequence, 40% of those are eliminated in the up-to 10 such sequences, and so on and so on. In fact as you get larger numbers, the predictive nature of the sum of the digits at any juncture allows eliminating more and more numbers asymptotically reaching zero.
E
C'mon Slashdot. I don't want to disable the auto-load feature, as it's useful. But not while I'm reading! Please detect user scroll and click activity, and put a 5-minute wait after any activity before resuming auto-update.
I was reading this particular summary when it bothered me again, so I'm attaching it here as a public bug report.
I feel fantastic, and I'm still alive.
With Knapsack (addition), we had a (rather insecure) assymetric crypto algorithm. Multiplying primes gives us RSA as an algorithm.
I wonder if integrating/differentating various functions can be used for a secure public/private key mechanism, if done correctly.
What is your view on the validity of computer-generated proofs, specifically those too large to ever be checked by even a concerted group of human beings?
It actually doesn't seem all that likely that there are infinitely many primes in this sequence. The density is a bit below logarithmic, so the usual probabilistic heuristic would already suggest that there probably aren't infinitely many primes. Then, this sequence often has trivial divisibilities (like by $2$ or $5$) which as far as that heuristic is concerned drop the density even further - I think to something like log log n.
Is there a special reason why we should believe this sequence contains primes? I would otherwise rather conjecture it contains finitely many, and given the numerical evidence quite possibly none.
When asked about the great conjecture of Collatz, Paul Erdos replied with "Mathematics is not ready for such problems".
Do you think we may find a branch of Mathematics that is actually an empirical science, akin to Wolfram's "New Kind of Science"?
The source, Kowalski, the source. Where is it?
CLI paste? paste.pr0.tips!
I know I always picture this Kowalski when I read APKs posts:
http://madagascar.dreamworks.c...
It makes for some great comedy.
APK likes to ask for responses to the same things over and over. Maybe he just likes the responses?
At 76 he has a much better chance of reaching 100 than you do. What's that like?
BTW, to use a car analogy, he may like Subarus and you don't, but maybe you both like BMWs? Why not ask him about girls or football?
I hope everybody is familiar with this Wonderful math-computer science pape A personal view of average-case complexity by R Impagliazzo
In this paper he give an excellent outline of the P=NP? problem, and talks about 5 possible words, Algorithmica, Heuristica, Pessiland, Minicrypt, and Cryptomania, where this question is answered differently. Professor Sloane, which land do you think we live in? Do you think that there are more than 5 possibilities?. Do you expect any progress on this question in the near future?
Thanks
Wayne Shanks
I blame the oddest prime of them all.
Get thee glass eyes, and, like a scurvy politician, seem to see things thou dost not.--King Lear
Mr. Sloane, what is your favorite integer sequence (that starts with an odd number and increases up to at least the 5th element in the sequence)?
You're just imagining things.
Which of the many unsolved problems (https://en.wikipedia.org/wiki/List_of_unsolved_problems_in_mathematics) have you tried to solve and for which one do you think you came close?
He does have that thousand yard stare down.
If you check the sum of digits, you find that five out of every six consecutive numbers are divisible by 2 or 3, and only one isn't. Normally two out of six numbers are not divisible by 2 or 3. That means these numbers are only half as likely as your average random number to be primes.
Normally, the probability that a random integer n is a prime number is about 1 / ln n. The probability that a random n digit number is a prime is about 1 / 2.3n. With these numbers, it is about 1 / 4.6n.
We can estimate the number of primes that we should find while adding all (0.9 * 10^k) k-digit numbers, ending with a number of (k - 1/9) * 10^9 digits: That estimate is about 0.5 + (1 / 4.6) / (k - 10/9). That's about 0.5444 for six digit numbers added, about 0.5369 for seven digit numbers, about 0.5315 for eight digit numbers. Hoping for a solution within the first million numbers is optimistic.
With all the renewed interest in post quantum computer cryptography, why do you think there is minimal research in the error correcting code styles of public-private key encryption? (e.g., the McEliece cryptosystem) Are there ones that you consider to be better candidates?
https://www.youtube.com/watch?v=7sWpSvQ_hwo
Mathematically, it seems that there could not be any true random integers since choosing any integer at random from an infinite set of integers would produce a number infinitely long. Are there no true random integers, just range limited mappings from a statistically generated set of real numbers?
Your books (with MacWilliams and with Conway, e.g.) are some of the best examples of beautiful combinatorial and geometric objects. The original motivation (error-correction) seems to be mostly irrelevant now. Should we keep looking anyway?
Some say that hot fields (e.g. machine learning) attract top talent and that's why we should hire in those. Some say hot fields are those where revolutions already happened, so we should not hire in those. What do you think? Any advice for a search committee in a top-ranked CS department?
Do you read any technology news regularly? Slashdot?
I have my B.S. in Computer Science and Mathematics.
I took Differential Equations, Partial Differential Equations, Numerical Analysis, Matrix Theory, etc. in College for my undergraduate.
I worked in Computers for 6 years, then moved into a management field. It's more money and responsibility. I haven't used anything more than simple math since I graduated college (Addition, Subtraction, Multiplication, Division), and most of the high-earners I work with never took anything more than the basic Calculus classes in college.
My question is, how can we bring more high-wage jobs that use advanced math skills into the business world?
1 + 1, everyone knows that, but what's 2 + 2? Got you there didn't I?
Twinstiq, game news
What is currently known about a possible finite projective plane of order 12?
(If that question has been settled, the same question for the smallest order whose existence is still in question?)
One of the current problems with training deep combinational neural networks is that it's often not easy to tell what you are training them to look for. People train NN blindly on vast data sets, but often have no idea how robust this training is before deploying them.
Do you think some of the mathematics surrounding orthogonal arrays can be extended to improve the metrics on how efficient or robust the training is of a neural network might be?
So what you are saying is that when he died, he was in the prime of his life.
Thank you thankyou... I'll be here all week :).
The sequence starts with 1.
You are welcome.
"APK doesn't think that DNS servers are worth running and seems to believe that somehow Microsoft Active Directory can run without DNS." - by Coren22 (1625475) on Tuesday October 27, 2015 @12:58PM (#50811615)
Where'd I say AD will run minus DNS Coren22? I've said AD = internal network DNS dependent as far back as 2007 http://forums.tweaktown.com/wi...
(Search this in BOLD there "To warn users who have ActiveDirectory/AD LAN-WAN setups to NOT use external DNS servers!" referring to OpenDNS suggestions for those using AD stupid in the POSTS BEFORE IT in my security guides for users (geared to stand alone single machines no less), & right there on that page proves it stupid - so even if you posted as myself someplace here on /. "impersonating me", I have your ass NOW, shithead!)
I've also stated MANY TIMES I use remote DNS in OpenDNS @ home (but not @ work on AD networks + exchange/outlook: Free OpenDNS model doesn't work with AD dependent Exchange + Outlook specifically you lying little imbecile).
I also don't hardcode in "every site there is under the sun" is why, so I have to use DNS, but OpenDNS & rarely.
I also RARELY MISS A LOOKUP since I put where I spend a good 95++% of my time online in my favorite sites into hosts @ the TOP of hosts for utmost LOCAL FASTER RESOLUTION SPEEDS and more reliability vs. Open DNS (not OpenDNS) resolvers being abused, Kaminsky redirect poisoned DNS servers (of which 99.999% of ISP DNS are not proofed against to this very day even though a patch exists which OpenDNS uses), rogue DNS servers, and yes ROUTERS with bushwhacked by malware DNS settings (happening a LOT lately).
Hardcodes in hosts are faster than remote DNS, waste less resources than local dns in power, cpu cycles, RAM, & other I/O by FAR considering ALL THE PARTS of such a setup in programs, data, I/O, & power (especially if setup as a separate machine).
APK
P.S.=> You're a disgusting liar... apk
"I guess we should avoid your crap, it looks like it is marked as malware. Good luck getting that removed." - by Coren22 (1625475) on Monday November 02, 2015 @03:52PM (#50850445)
It's safe proven by 57 antivirus programs recently in BOTH its 64-bit model https://www.virustotal.com/en/...
+
Its 32-bit model too https://www.virustotal.com/en/...
&
More "SALT IN YOUR WOUNDS" -> http://f.virscan.org/APKHostsF...
---
MalwareBytes' hpHosts Admin (MalwareBytes employee) hosts & recommends it -> http://hosts-file.net/?s=Downl... & MalwareBytes = BEST antivirus per this VERY recent testing of them all http://www.av-test.org/en/news...
APK
P.S.=> /.'ers say my work is good too:
"his hosts program is actually pretty good" - by xenotransplant (4179011) on Monday August 10, 2015 @03:34PM (#50287195)
"I like your host file system." - by Karmashock (2415832) on Wednesday September 09, 2015 @03:57PM (#50489401)
"APK is kinda right... I've given up on JS based adblocking and gone to blackholing in /etc/hosts, just like it was back in the 90s. The computational load has gotten intolerable for any ad-blocking using JS. I've tried his hosts file generating software. It works." - by bmo (77928) on Thursday October 15, 2015 @11:30AM (#50736071)
"his hosts tool is actually useful for those cases in which one does indeed want to locally block stuff outright while consuming minimum system resources" by alexgieg (948359) on Friday September 25, 2015 @09:57AM (#50596461)
... apk
Coren22 says "hosts=bad" (they add security, speed, & reliability) & bitches on admin priv to UPDATE vs. threats
"So, have you figured out why privilege escalation is a bad thing yet?" - by Coren22 on Tuesday September 22, 2015 @05:15PM (#50577809)
& admits using admin priv himself
+
How else can I programmatically update hosts minus it in Windows?
---
"Of course it requires elevation to write to the hosts file" - by Coren22 (1625475) on Wednesday September 23, 2015 @05:35PM (#50585879)
You FINALLY later admit there's no other way!
FACT:
Even MalwareBytes AntiMalware (best one) DEMANDS you use admin privelege (you saying it's "bad" too?) it can't do its job fully otherwise, like many security tools do!
APK
P.S.=> Lastly - Coren22, there is a CURE for your "outism" due to your retarded by assburgers clearly defective brain (lol) - quit making childish sigs about me & sockpuppet accounts as well as telling lies about me - I'll stop OUTING you... apk
What do you think of some "intelligence" tests which give three or four numbers in a sequence, and then ask you to find the next term? I imagine you would agree that there is no single right answer, but is there any use to such a test if interpreted by a human (perhaps with the test-taker being asked to explain the pattern)?
what is incredible for this sequence idea is that instance is base dependent. but definition not. I mean, base-10 : 1,12,123,1234,12345,... base-2:1,110=4 base 10, 11011=27 base 10, 11011100 = 220 base 10, 11011100101 =1765 base 10 base-4:1,12=6 base 10,123=27 base 10,1210=100 base 10, base 8:1,12=10 base 10, 123=83 base 10, 1234=... 123 in base 8 is 83 in base 10 which is prime. So I do believe there is infinite primes on base 10, it's not a solid belief, but anyway it's not the case. the case is that any huge prime generated by this idea can be optimally compressed by its last part.
on whether P=NP or P!=NP?
Is P NP?
2+2=5?
I have always been very impressed with your book with Conway on sphere packings. This seems somewhat removed from what you are most known for. But it is clearly required a massive amount of work. How do you balance such projects against OEIS? (I can see how OEIS, once started, can take care of itself to some extent, but still it seems to me that the book with Conway must have been exhausting.) Do tell!
I'm NOT obligated to give away MY work to be misused as Chrome's was-> http://it.slashdot.org/story/1... [slashdot.org] which you ADMIT I'm not http://it.slashdot.org/comment... [slashdot.org]
Isn't your garbage offered up for free? No, you aren't obligated to give it away, but by all appearances you do, you just refuse to submit to a code review to make sure your crap isn't designed to do anything malicious.
APK likes to ask for responses to the same things over and over. Maybe he just likes the responses?
Hi M. Sloane,
My question would be, why are prime so fascinating?
We know a lot of special properties about them. There are tons of other specials numbers, other calculus base or forms, but still, prime numbers seem to be at the core of every mathematician passion. Is it a sort of myth, a defy or just they are really different from whatever other numbers we can think about, and if so, why?
So .. in small words .. what's the point?
What is the use of these things?
Maybe this is silly, but ...
I don't know if the Hollywood writer for the TV series Person of Interest consulted a mathematician about this, but in one episode, it was claimed that in the digits of Pi every possible finite sequence appears somewhere in it, including the ASCII codes for the complete works of Shakespeare and the main character's name.
Can that be true? I could imagine it containing everything but a given sequence, like the works of Shakespear, since you could still have it non-repeating. For example, if you excised every occurrence of 1337 in it, you would have a different number of course, but it would still be a non-repeating one, wouldn't it? Is it in a special class of non-repeating decimals?
See subject & links where I tried to make peace - says it all w/ proof of it from his trolling "signature boy" mouth http://slashdot.org/comments.p... & here too http://slashdot.org/comments.p... + here http://slashdot.org/comments.p...
* :)
(I've discovered that trying to make peace with a mental retard due to assbergers & OUTISM is a difficult thing & largely apparently unachievable...)
APK
P.S.=> You brought it on yourself Coren22, nobody else - you sow the wind? Here comes the whirlwind, & all your sockpuppets, signatures, & fellow trolls can't stop it (lol, you're 'outta bullets' in downmods) - so "the beatings will continue" until you stop your immature childish signature bs... apk
See subject: Says it all & this link, dismantling him point-by-"so-called 'point'" of his publicly http://slashdot.org/comments.p...
* :)
(Coren22, I tried to give you a chance, 3x no less - you're a fool: You mistake mercy for weakness, like cretin brutes in the streets do... you paid the price!)
APK
P.S.=> I notice you stopped responding there - "Gosh, golly gee - why's that?" (not) - but I expect you'll TRY some more b.s. as that's all "your kind" (trolls) understand - crap like downmodding my posts or ac troll me!
(Which you & your sockpuppets OR fellow trolls have here already NOW TELLING OTHERS TO TROLL ME BY UNIDENTIFIABLE AC POSTS http://slashdot.org/comments.p... as I've torn you ALL up 1 by 1 every time as I have yourself above... you did this, to yourself "signature boy")... apk
These days, with the internet, there is opportunity to do hobbyist science like Zooniverse and OEIS. Do you know of other math projects like OEIS that the public can contribute too?
If we humans could easily change our predominantly decimal number system to a different base, which base would you choose? Hexadecimal as it's easy to translate to and from binary (as well as base 4)? Any other bases or benefits? Is base 12 ideal due to today's frequent usage of dozen counting, time and 12's many useful divisors?
Quick question - I'm coming up on 30 fairly soon, and am doing handily for myself as a consultant, but still have a slight regret of not taking the PhD I was planning to do following my masters degree in maths. My question for you - does the old paradigm of most mathematicians so their best work by their mid-30s still hold, or am I still in a position to start my doctorate in Complexity Science in a few years time?
Jamie