Live data from Hacker News

Prime numbers so memorable that people hunt for them

scientificamerican.com

91–100 of 106 posts

Re: Prime numbers so memorable that people hunt for them

#91

A few other memorable primes: https://math.stackexchange.com/questions/2420488/what-is-tri... 888888888888888888888888888888 888888888888888888888888888888 888888888888888888888888888888 888111111111111111111111111888 888111111111111111111111111888 888111111811111111118111111888 888111118811111111118811111888 888111188811111111118881111888 888111188811111111118881111888 888111888811111111118888111888 8881118888811111…

These are so cool.

Re: Prime numbers so memorable that people hunt for them

#92

Earlier quoted context omitted.

> Belphegor (or Baal Peor, Hebrew: בַּעַל-פְּעוֹר baʿal-pəʿōr – “Lord of the Gap”) is, in the Abrahamic religions, a demon associated with one of the seven deadly sins. According to religious tradition, he helps people make discoveries. He seduces people by proposing incredible inventions that will make them rich. Huh. Would feel right at home in our industry. > According to some demonologists from the 17th century,…

Can’t spell “demon” without “demo”. Cue the church lady.

Startup > trapt (archaic) us

Re: Prime numbers so memorable that people hunt for them

#93
post #71

Earlier quoted context omitted.

I thought everybody factors phone numbers. I also factor the odometer reading in my car while driving.

How do you do mental factoring?

I don’t usually keep the factors, but I have a variety of techniques. Putting aside the trivial cases of divisibility by 2, 3, 5, 11¹ and 37², a lot of it comes down to find ways to make the numbers smaller, so, for example. my current odometer reading is 13,857. To test for divisibility by 7, I can turn that into 14,000-13852=143 which I can tell at a glance isn’t divisible by 7. It is divisible by 3, so I can reduce it to 4619 which isn’t divisible by 3 and I can also tell it’s not divisible by 11. I can also rule out 19 at a glance. To check 13, I might do my right-side divisibility test where I start by subtracting 39 from the right, which gives 458. I could continue with that, but taking 39 from the left gets me to a small enough number faster of 68 which isn’t divisible by 13. Right-side divisibility for 17 takes 119 from the right leaving 45 which isn’t divisible by 17. For 23, I can do a left-side removal of 46 to rule that out. 29, go right to bring it to 459 and then 43, not divisible by 29. For 31, I’ll do right side to get 434 and then 31 so 4619=149×31 and 149 is prime and I’m done.

1. To check for divisibility by 11, subtract the sum of even numbered digits from the sub of odd numbered digits. If 11∣n, then you’ll have a multiple of 11. E.g., for 13,857, we compare (3+5)-(1+8+7)=-8 which is not a multiple of 11.³

2. To check for divisibility by 111, we take advantage of the fact that 3×37=111, 27×37=999 and thus 1000≡1(mod 37) and we can then add up the digits in groups of 3, and pull out the most convenient multiple of 111 to see if we have 0, 37 or 74. E.g., with our example about, 13+852=865-888=-23 which is not a multiple of 37.

3. As an added bonus that number is the remainder when dividing by 11. Similarly the number I get with the check in footnote 2 is the remainder when dividing by 37.

Re: Prime numbers so memorable that people hunt for them

#94
post #93

Earlier quoted context omitted.

How do you do mental factoring?

I don’t usually keep the factors, but I have a variety of techniques. Putting aside the trivial cases of divisibility by 2, 3, 5, 11¹ and 37², a lot of it comes down to find ways to make the numbers smaller, so, for example. my current odometer reading is 13,857. To test for divisibility by 7, I can turn that into 14,000-13852=143 which I can tell at a glance isn’t divisible by 7. It is divisible by 3, so I can reduc…

Interesting! What do you do when you try to factor a large number that doesn't yield to any of your mental factoring techniques? It might be prime, after all, or composite with only large prime factors. Do you give up after a while? Run it through a factoring program? Keep plugging away until you get to the number's square root?

Re: Prime numbers so memorable that people hunt for them

#95
post #55
post #17

Doesn't take very much searching to find this pretty nifty palindrome prime: 3,212,123 (the 333rd palindrome prime) Interestingly, there are no four digit palindrome primes because they would be divisible by 11. This is obvious in retrospect but I found this fact by giving NotebookLM a big list of palindrome primes (just to see what it could possibly say about it over a podcast). For the curious, here's a small set o…

> Interestingly, there are no four digit palindrome primes because they would be divisible by 11. In fact, this holds for any even number of digits.

11 is an even-digit palindrome and is a prime number

Re: Prime numbers so memorable that people hunt for them

#96
post #93

Earlier quoted context omitted.

How do you do mental factoring?

I don’t usually keep the factors, but I have a variety of techniques. Putting aside the trivial cases of divisibility by 2, 3, 5, 11¹ and 37², a lot of it comes down to find ways to make the numbers smaller, so, for example. my current odometer reading is 13,857. To test for divisibility by 7, I can turn that into 14,000-13852=143 which I can tell at a glance isn’t divisible by 7. It is divisible by 3, so I can reduc…

Hello fellow hobby factorizer :)

I wanted to share this small gem of a paper in case it helps you like it's helped me:

"Simple divisibility rules for the 1st 1000 prime numbers": https://arxiv.org/pdf/math/0001012

Re: Prime numbers so memorable that people hunt for them

#97
post #82
post #62

My family’s phone number when I was a child was both a palindrome and a prime: 7984897. My parents had had the number for two decades without noticing it was a palindrome. I still remember my father’s delight when he got off a phone call with a friend: “Doug just said, ‘Hey, I dialed your number backwards and it was still you who answered.’ I never noticed that before!” A few years later, around 1973, one of the othe…

Follow-up: My formal study of programming stopped with that Fortran IV class a half century ago, but LLMs now delude me into thinking I can program. I just had Claude write me a Python program to list all of the seven-digit numbers that are both primes and palindromes. It found 668: 1003001, 1008001, 1022201, 1028201, 1035301, ...

I wondered if we map English letters to digits (a=0, b=1, c=2, ... , z=25) is there anything which is both a palindrome in its English form and in its number form, and prime? I took a list of palindromes from Wikipedia[1] and tested them, and yes:

deified 3485843

bib 181

did 383

I note that none of them use letters which map to double-digits (k=10, l=11, m=12, etc.); none of the palindrome sentences make palindromic numbers (ignoring case, stripping all punctuation); could there be one which does?

[1] https://en.wiktionary.org/wiki/Appendix:English_palindromes

Re: Prime numbers so memorable that people hunt for them

#98
post #94
post #93

Earlier quoted context omitted.

I don’t usually keep the factors, but I have a variety of techniques. Putting aside the trivial cases of divisibility by 2, 3, 5, 11¹ and 37², a lot of it comes down to find ways to make the numbers smaller, so, for example. my current odometer reading is 13,857. To test for divisibility by 7, I can turn that into 14,000-13852=143 which I can tell at a glance isn’t divisible by 7. It is divisible by 3, so I can reduc…

Interesting! What do you do when you try to factor a large number that doesn't yield to any of your mental factoring techniques? It might be prime, after all, or composite with only large prime factors. Do you give up after a while? Run it through a factoring program? Keep plugging away until you get to the number's square root?

With the odometer I have a time limit to factor the number (around one minute on the highway, up to four on surface streets). I usually have no problem factoring a four digit number (time in 24-hour format) within the minute given, especially since the worst case scenario would be 22:09=47×47. When factoring, it’s less about recognizing the primes as the key composites once you get down to four digits or less, which usually happens surprisingly quickly.

Re: Prime numbers so memorable that people hunt for them

#99
post #82

Earlier quoted context omitted.

Follow-up: My formal study of programming stopped with that Fortran IV class a half century ago, but LLMs now delude me into thinking I can program. I just had Claude write me a Python program to list all of the seven-digit numbers that are both primes and palindromes. It found 668: 1003001, 1008001, 1022201, 1028201, 1035301, ...

I wondered if we map English letters to digits (a=0, b=1, c=2, ... , z=25) is there anything which is both a palindrome in its English form and in its number form, and prime? I took a list of palindromes from Wikipedia[1] and tested them, and yes: deified 3485843 bib 181 did 383 I note that none of them use letters which map to double-digits (k=10, l=11, m=12, etc.); none of the palindrome sentences make palindromic…

How about representing the words as numbers in base 26? That would preserve the palidromicity for both the word and the number, and primality would not be affected by the base representation.

Might not be as much fun, though.

Re: Prime numbers so memorable that people hunt for them

#100
post #93

Earlier quoted context omitted.

I don’t usually keep the factors, but I have a variety of techniques. Putting aside the trivial cases of divisibility by 2, 3, 5, 11¹ and 37², a lot of it comes down to find ways to make the numbers smaller, so, for example. my current odometer reading is 13,857. To test for divisibility by 7, I can turn that into 14,000-13852=143 which I can tell at a glance isn’t divisible by 7. It is divisible by 3, so I can reduc…

Hello fellow hobby factorizer :) I wanted to share this small gem of a paper in case it helps you like it's helped me: "Simple divisibility rules for the 1st 1000 prime numbers": https://arxiv.org/pdf/math/0001012

Meh, most of those aren’t all that helpful. Multiplying the last digit by -17 and adding that to the rest of the number to do a divisibility test for 19? I’d be more inclined to do the right-side reduction which isn’t appreciably different and, if you’re good at keeping some side numbers in working memory can give you the actual quotient if it is divisible which these rules won’t give you.
Post reply on HN