Another brick (in the wall)
Now we would like to make bricks (to throw them in Putin's face?) By superimposing two numbers in a «correct» way.
This is for instance a 2-integer brick we accept:
9371733
Why? Because, when we read vertically, we encounter only prime numbers. They are (left to right):
19, 23, 97, 11, 97, 53, 13.
Note that neither 1291951, nor 9371733 are primes – we
are only interested in vertical 2-digit (sometimes 1-digit) primes.
Here are four bricks we accept – and four we don’t:
We accept:
a b c d
14 17 513 23567898
391 213 37 13973
We reject:
e f g h
14 17 413 235678980
191 913 17 139735
Why?
a:
the leftmost vertical integer is seen here as the prime “3” – the next two are
19 and 41;
b:
the leftmost vertical integer is seen as the prime “2” – the next two are 11
and 73;
c:
the leftmost vertical integer is seen as the prime “5” – the next two are 13
and 37;
d:
the successive correct vertical primes are 2, 3, 5, 61, 73, 89, 97 and 83;
e:
the leftmost vertical integer “1” is not a prime;
f:
the leftmost vertical integer “9” is not a prime;
g:
the leftmost vertical integer “4” is not a prime;
h: no
brick can bear the digit “0” (zero).
How about a brick-sequence?
Definition: lexicographically earliest sequence of distinct
positive integers such that a(n) written on top of a(n+1) forms an accepted 2-integer
brick.
S = 1,3,7,9,27,31,11,71,91,73,17,19,37,13,77,33,211,39,217,93,271,97,273,311,79,237,313,111,113,117,119,137,171,131,173,191,133,317,…
Commentaires
Enregistrer un commentaire