
Every prime number past 100, in base ten, has a small integer attached to it. The integer is determined entirely by the prime’s last two digits.
For , it is . For , it is still . Both end in .
Here is what the eight measures. Write out all the fractions from to and compare the first two digits after the decimal point. Some of the rows begin like this.
1/109 = 0.00917… match
2/109 = 0.01834… no match
12/109 = 0.11009… match
13/109 = 0.11926… match
There are eighteen matches in the complete table. Subtract ten, the whole-number part of , and eight remains.
At denominator , there are rows and matches. Subtract the whole-number part of , which is . Eight remains again.
The number of rows has grown. The number of matches has grown. The difference has stayed put.
A prime above can end in , , , or . There are ten possibilities for the tens digit, so forty possible endings. Here they are, with the collision deviation written in each cell. The small label identifies the ending. The large number is its value.
To find , go to row , column . To find , go to row , column . The first gives . The second gives .
The table is small enough to read in full. Eight entries are positive, twelve are zero, and twenty are negative. Some endings share a value. Ending in fixes the answer at , but a value such as zero appears in several different cells.
I call the integer a collision fingerprint. Its definition in base is
Here counts the fractions whose first two digits agree. The brackets mean take the whole-number part. The quantity being subtracted is the bin scale, a simple integer baseline for the count.
There is more scope here than the opening about primes suggests. The same rule holds for every denominator with no factor in common with the base. For example, is composite. It has matches, a bin scale of , and the same in cell .
Primality never enters the finite calculation.
Why should only two digits of the denominator survive?
The fractions we are testing lie between zero and one. Cut that interval into a hundred equal pieces. Each piece specifies the first two decimal digits. The first runs from to , the second from to , and so on.
A match lands in one of ten pieces, those beginning
00 11 22 33 44 55 66 77 88 99
Counting the fractions in those ten little intervals gives the collision count. Nothing beyond the second digit is needed.
Now increase the denominator from to . Each of the hundred intervals gains exactly one fraction. Each of the ten matching intervals therefore gains one match. The collision count goes up by ten. The bin scale also goes up by ten. Their difference stays unchanged.
This is where the floor arithmetic earns its place. The number of fractions between two boundaries is a difference of floors. Adding to the denominator adds one to each such difference. Coprimality keeps the fractions off the interior boundaries, and the endpoint at one is excluded from both counts.
In base , there are two-digit pieces and matching pieces. Increase the denominator by and both terms go up by . The same cancellation gives
The notation names the finite table. In decimal, the remainder modulo is simply the last two digits. The size of the denominator has disappeared from the deviation.
Return to and . Their addresses add to . Their values add to .
Try and . The values are and . Try and . The values are and . Again, minus one.
Pair each ending with . There are twenty pairs. The figure puts each pair on a number line so that you can see both the sum and the midpoint.
The exact identity is
The decimal pairs let us check it in one base. The proof uses the interval count to establish it in every base. Reflect the two floor counts and their interior contributions pair off. The first and last intervals have different endpoint corrections. Keep those corrections, subtract the two bin scales, and the remainder is exactly minus one.
The natural center of this table is therefore . The entry is eight and a half units above it. The entry is eight and a half units below it. Adding to every cell would put the reflection center at zero.
There is also an exact answer to the question of how many entries are negative. Two nonnegative integers cannot add to . Two negative integers cannot either, since their sum would be at most . Each pair has exactly one negative member.
Half the table is negative. The other half contains the positive entries and the zeros.
The mean follows just as directly. Twenty pairs contribute a total of across forty cells, giving . This is an average over the cells themselves, available before any prime cutoff is chosen. It is part of the finite data that The Centered Collision Sum uses to separate fixed class biases from the sum over primes.
In base three there are six admissible cells. In base twelve there are forty-eight. The individual values change, and so does the number of zeros. The negative half stays exactly half.
The extrema have a short formula too. The largest value is , attained at the ending . Its complementary ending, , has the smallest value, .
In base ten those are and . In base twelve they are and . These are sharp bounds. They do not say that every integer between the bounds must appear.
The reflection alone does not determine all the cells. It tells us how they pair, where their mean lies, and how many are negative. The floor count supplies the individual values. Together they give a table that can be computed without searching for a prime in any of its classes.
There is an especially small way to see the at ending .
Use denominator . Its eight fractions begin , , all the way through . Every row matches. The count is eight and the bin scale is zero. The deviation is already .
At , the count is eighteen and the baseline is ten. At , they are and . The table records what survives those equal increases.
For denominators coprime to ten, adding leaves the deviation unchanged. That is the periodicity. It holds whether the denominator is prime or composite.
So those eight fractions at denominator already give the deviation for every larger denominator ending in .
Comments
Sign in to join the discussion.