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?
How you pronounced the period between two sets of numbers depends on the context. Mathematic users typically use the word point (i.e., ten point one six). Computer users who refer to the dot notation for IP addresses will use the word dot (i.e., 172 dot 0 dot 0 dot 1). I don't think the two words are interchangeable.
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.
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.
What is your motivation?
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.
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."
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.
nine?
APK likes to ask for responses to the same things over and over. Maybe he just likes the responses?
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?
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"?
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
How would an enlightened foreigner say "That never gets old?"
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?
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?
1 + 1, everyone knows that, but what's 2 + 2? Got you there didn't I?
Twinstiq, game news
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?
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.
So .. in small words .. what's the point?
What is the use of these things?
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?
Why is the square root of -1 so provocative?
It's not.
It just means that your equations have an inherent variable or "dimension" that is orthogonal to the explicit variables.
See the derivation of the calculations of phase shift in AC motors.