Tell us an interesting random fact you stumbled across (Part 1)

You’re probably thinking of a particular Sinjin:

I can’t think of another one, so best not to generalize.

j

ETA: tell a lie, I can; and his name was pronounced Saint John.

Norman St. John Polevaulter

1 had to be a red-haired girl

First thing I thought of were the Hawke brothers from “Airwolf”.

Lemon-stir.

When we hear Leo-minster we can tell you’re from away

I knew a “St.John” pronounced “Sinjin” in Charleston, SC. I think its the accepted pronunciation in the South. I also knew one diminuated as “Saint” presumably because his father was Sinjin.

If you take any random 5-digit number (example: 65,223) and repeat the sequence to create a 10-digit number in the billions (6,522,365,223), the result is always evenly divisible by 9091.

Also divisible by 11. Repeating a 5-digit number like that is the same as multiplying the original number by 100,001. And 100,001 = 9091 x 11. QED.

I’m not proud of knowing this, but David Warner played a character in ST V named St. John Talbert, pronounced “Sinjin Talbert.”

This is possible for any length string of digits isn’t it? Multiplying single digit numbers by 11 will repeat the string. Two digit numbers multiplied by 101, three digits by 1001, etc. They all end up being evenly divisible by 11, and sometimes multiples of 11.

St. John Quincy from the flop TV show OK Crackerby!

Never shown here in the UK, I would hazard. But in any case, TIL that there are more Sinjins knocking around than I realized.

j

Ian St John

As in the famous graffiti on a church advertising sign:

JESUS SAVES!

But St John nets the rebound

I think in general it only works if the number of repeated digits is odd. 101 is not divisible by 11, nor is 10,001, nor is 1,000,001. But 1001, 100,001 and 10,000,001 all work.

I’m seeing it’s not as simple as I thought. Of course the multiplier that repeats the initial string need to be divisible by 11. There’s a multiplier that will repeat anything length string of digits, but not necessarily evenly divisible by anything else, such as 101.

To find appropriate multipliers, we can use the fact that a^n+1 is divisible by a+1 if n is odd. So (with a=10), a number
100…001 is always divisible by 11 if there are an even number of zeros.

So, if we take any 7-digit number and repeat it to make a 14 digit number, it will always be divisible by 909091 and by 11, since 10000001 = 909091 x 11.

To go down the inverse of multiplication oddities…
1/7 expressed as a decimal is 0.142857142857142857…
The same 6 digits repeating.
2/7 expressed as decimal is 0.285714285714285714…
The same digits repeating, just starting from a different point.
3/7, 4/7, 5/7 and 6/7 all use the same pattern - with a different starting point.

The inverses of all prime numbers all show similar patterns (except for 2 and 5 - we use the decimal sytem and 2 and 5 are factors of 10).
The number of repeating digits is one less than the number being inverted - example 1/7 is 6 recurring digits, 1/17 is 16 recurring digits etc
EXCEPT
sometimes there are two or more patterns of recurring digits in the inverses. For example:
1/13 = .076923 - six recurring digits.
2/13 = .153846 recurring - a different set of 6 recurring digits.
1/13, 3/13, 4/13, 9/13, 10/13 and 12/13 all use the .076923 recurring pattern - the other fractions use the other pattern.
so - Inverses of 13 uses 2 different patterns of 6 digits - 2x6 = 12 (one less than the number being inverted). EG:
Inverses of 3 uses 2 different patterns of 1 digit - 2x1 = 2.
Inverses of 11 uses 5 different patterns of 2 digits - 5x2 = 10.
Inverses of 37 uses 12 different patterns of 3 digits - 3x12 = 36.
Inverses of 41 uses 8 different patterns of 5 digits - 8x5 = 40.
Inverses of 53 uses 4 different patterns of 13 digits - 4x13 = 52.
Etc…

It is apparently all explainable and fairly trivial, but it blows my mind.

In Sleuth, one of the characters is a famous mystery writer named Andrew Wyke. Like Agatha Christie and Hercule Poirot, Wyke has a famous detective featured in his novels; St. John Lord Merridew. In the first movie version, Lawrence Olivier pronounces it “Sinjin”. That was the first time I ran across that affectation.

I gather that Anthony Shaffer, who wrote Sleuth, wanted the Wyke character to be terribly posh and pretentious. Just the sort who’d write about an aristocrat detective named “Sinjin”.

I found out that the opening music for “Bill and Ted’s Excellent Adventure”(the song I Can’t Break Away)
was not original with the film. It was a cover from a singer in the 60’s named Chuck Jackson.

… No idea if that’s how Shaffer intended him, but that’s how I played him. FWIW.