Maths Problem - Any Mathematicians out there?
Discussion
Challenge for you that is hurting my brain …
I have 10 digit sequential reference numbers, each with a check digit as the 11th digit:
0000000001 (chk)
0000000002 (chk)
0000000003 (chk)
etc
Assuming that all the reference numbers are used (9 billion?) How many times will the last 4 digits (including check digit) be the same as another reference number's last 4 digits?
Many thanks
I have 10 digit sequential reference numbers, each with a check digit as the 11th digit:
0000000001 (chk)
0000000002 (chk)
0000000003 (chk)
etc
Assuming that all the reference numbers are used (9 billion?) How many times will the last 4 digits (including check digit) be the same as another reference number's last 4 digits?
Many thanks
How many variations are possible from the first 7 digits? This is your answer... I think, I've looked at the issue for about 20secs and I'm trying to respond first 
Edit: Damn, just realised ur check digit is going to be either 0 or 1. This confuses matters somewhat

Edit: Damn, just realised ur check digit is going to be either 0 or 1. This confuses matters somewhat

Edited by StottyZr on Wednesday 25th July 14:41
StuStu said:
Challenge for you that is hurting my brain …
I have 10 digit sequential reference numbers, each with a check digit as the 11th digit:
0000000001 (chk)
0000000002 (chk)
0000000003 (chk)
etc
Assuming that all the reference numbers are used (9 billion?) How many times will the last 4 digits (including check digit) be the same as another reference number's last 4 digits?
Many thanks
I presume I've missed the point, but would you not need to know how the chk digit is calculated?I have 10 digit sequential reference numbers, each with a check digit as the 11th digit:
0000000001 (chk)
0000000002 (chk)
0000000003 (chk)
etc
Assuming that all the reference numbers are used (9 billion?) How many times will the last 4 digits (including check digit) be the same as another reference number's last 4 digits?
Many thanks
OK, the Luhn algorithm is relatively simple and from a little experiment I've just done it appears to give a even distribution of check digits so the 11th digit in your number can just be considered as any other number.
So you want to know how many combinations there are of x,xxx,xxx,yyy-y where the yyy-y are identical. 10 million I think. Of course, if my assumption about the even spread of results from the Luhn algorithm is wrong, then this is wrong too and it would depend on which check digit you were interested in as to how many matching last 4 combinations there are.
So you want to know how many combinations there are of x,xxx,xxx,yyy-y where the yyy-y are identical. 10 million I think. Of course, if my assumption about the even spread of results from the Luhn algorithm is wrong, then this is wrong too and it would depend on which check digit you were interested in as to how many matching last 4 combinations there are.
Gassing Station | The Lounge | Top of Page | What's New | My Stuff




