I was talking to my smart nephew the other day. He loves math and loves even more to stump me with math riddles and puzzles.

**Me:** Let’s talk about some fun problems with prime numbers*. I’m thinking of two prime numbers that add up to 753, what are they?

**Nephew (instantly)**: Oh, come on, Uncle. That’s too easy. Clearly if the sum of two numbers is odd (in this case 753) then one of them must be even and the other odd. But the only even prime number is 2, so your numbers are 751 and 2.

**Me**: OK, you’re a genius.

**Nephew**: I have one for you. Think of prime numbers with a single digit repeated many times. The smallest such number is 11. What’s the next one?

**Me**: OK, Let’s see. A single digit repeated. A number like 777, hmm. Clearly the digit cannot be anything other than a 1 because if it’s any other digit like 7 the number will be divisible by 7 and hence not prime.

**Nephew**: Good

**Me**: So the prime will be composed of repeating 1’s. It’s not 111 because 111=37×3. It’s not 1111 because that can be divided by 11. What about 11,111? How do I check what the factors are for 11,111 or whether it’s a prime?

**Nephew**: You’re on the right track, my smart but oh-so-out-of-touch Uncle. Have you tried a great tool called * Wolfram Alpha*? It’s an

*Answer Engine*as opposed to a mere search engine. It actually calculates your query using the famous computational program, Mathematica, written by scientist, Stephen Wolfram. Among other things it will factorize any number for you – within limits, of course. No one can factorize extremely large numbers, those containing say 100 digits, yet. But Wolfram Alpha will do any math that is possible, even including symbolic math and closed form equation solving, and will give you the latest conjectures to boot.

Try it and see if you can factorize 11,111.

So I pulled up my iPad, went to the site *www.wolframalpha.com *and typed in “factorize 11,111” as below:

Back came the answer:

It had factored my number: 11,111 = 41** ×** 271.

**Me**: You have shown me a great new resource, dear nephew. Now I shall try numbers with repeated 1’s to find a prime number.

**Nephew**: Great! And did you notice that you only need try numbers with 1’s repeated *a prime number of times? *So you needn’t try 1 repeated six times or 111,111 because 6 is composite. Since 6=3×2, you know 111,111 will be divisible by 11 or 111. Right?

**Me**: I was just going to say that myself. So the next numbers we will try will have repeating 1’s: 7, 11, 13, 17, 19, 23…. times. We tried them on the Wolfram Alpha Math Engine and got:

7: 1 111 111 = 239 **×** 4649

11: 11 111 111 111 = 21 649 **×** 513 239

13: 1 111 111 111 111 = 53 **×** 79 **×** 4187 **×** 265 371 653 **×** 14 064 697 609

17: 11 111 111 111 111 111 = 2 071 723 **×** 5 363 222 357

19: 1 111 111 111 111 111 111 = **Prime!!!**

Success! The smallest prime number with a repeating digit (after 11) is 1,111,111,111,111,111,111 or 1 repeated 19 times! We would never have been able to compute this using any conventional program like Excel or a traditional search!

Turns out the next one is 1 repeated 23 times and then we don’t see any more primes of this form for quite a while. They are there though. Many have been found but it’s a tough job even for very fast supercomputers.

Wolfram Alhpa is a real boon. Try it if you love playing with numbers or symbolic math. Here’s one last result I got playing with this fantastic math engine. I asked for the integral of secant(x). The answer, along with graphs, a Taylor’s series expansion and much more came out as below:

What a fun resource available to all math freaks!

Thanks, Ashok, terrific!

BTW, public key cryptography is based entirely on the idea that it will take many years for the fastest computer in the world to find factors of 100+ digit numbers that are products of two primes. It may not be long before Wolframalpha is able to crack such numbers quickly!

-Akhil

lots of fun, Ashok. Your “nephew” sounds so much like his uncle that I wonder …………….. (I envision a magic mirror that reflects a much younger version of oneself).

As for your quip: “Prime numbers, as most of you know are numbers that cannot be divided by any other number, except of course 1”. I would note that all prime numbers are also divisible by one other number, themselves! cheers.

This is an amazing resource. Thanks to you and your nephew for introducing this. The two brilliant ones makes learning a fun activity.

Thanks Krish for your nice compliment.

You’re right on your second point. Every number is divisible by itself. That’s why I said: it cannot be divided by any OTHER number, except 1.

What about a similar website for statistical analysis?

Another great property of all Prime Numbers, greater than 3, (and I mean ALL Prime numbers, no matter how big, or even bigger than 100 digits), is that the square of the Prime when divided by 12 will always leave a remainder of 1. This property of Primes, greater than 3, can be used to make sensational puzzles, that can fox a lot of people. But this is a property, which any budding Mathematician, must know. Cheers. Dev Vaish

– – – any engine to decrypt Prime ministers? Like no one can decipher ours except for himself and one and the only one key figure ‘SG’ – – – well, i am a PJ master and Don Quixote in the world of numbers – – so just delete this ASAP, lest it corrupts the blog.

– – – Anyways, hats off and all the best to you and the wiz-kid

– Shashank Joshi (Kumaon 69Ca -3)