20190201, 14:31  #1 
"Mike"
Aug 2002
7,691 Posts 
February 2019

20190205, 08:05  #2 
Aug 2010
Kansas
547 Posts 
Any tips on pseudocode to identify the endpoint? I think I figured out the rest on my own.

20190211, 18:41  #3 
Oct 2017
89 Posts 
My problems are the following:
1. I don‘t see the 64 different values of the relatedness score. I have found a paper which explains the „19276“, but I have not found the complete WORD. 2. I don‘t see any correlation between the 14 and the 64. 3. I don‘t see the sense of the condition „with each digit being used exactly once“ the screenshot contains 0,444444 and so on. I think that I have completely misunderstood the challenge. 
20190211, 19:03  #4  
Aug 2010
Kansas
547 Posts 
Quote:
nScorers nValues examples 1 2 0,1 2 3 0,.5,1 3 5 0,.33,.5,.66,1 4 7 0,.25,.33,.5,.66,.75,1 5 11 6 13 7 19 8 23 9 29 10 33 11 43 12 47 13 59 14 65 2. See above 3. This endpoint refers to the equivalent of the 64/65. You would need to identify a 10 digit number of possible values, such as 1,023,456,789 which contains each digit exactly once. 

20190212, 15:47  #5 
Feb 2017
Nowhere
3·1,153 Posts 
I see that you can earn an asterisk if you solve the problem in hexadecimal. As of the most recent update, nobody had done so.
Alas, I don't know a slick'n'quick way to get a hold of the hex expression for an integer. Even if I did, I also don't know a slick'n'quick way of doing the requisite integer computations to produce the numbers to be tested. Knowing the approximate size of the integers that need to be tested, I reckon it would take me quite a while just to get there. Pass. 
20190212, 16:55  #6  
Jun 2003
11125_{8} Posts 
Quote:
And we're looking for 10 digit (resp, 16 hex digit) count with all the digits used? If so, there are 50 possible solutions in base10 (found using PARI script in 0.3s). 

20190212, 16:55  #7  
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
13132_{8} Posts 
Quote:
I found a really simple solution based on OEIS. I am not certain whether it is correct if anyone has solved I would like to confirm my answer with them before sending it. It seemed way too easy to me. Speed is going to be an issue for base 16 based on the size of the smallest pandigital number in base 16 https://en.wikipedia.org/wiki/Pandigital_number 

20190212, 17:34  #8 
Jun 2003
4693_{10} Posts 

20190212, 19:23  #9 
Jun 2003
13×19^{2} Posts 
Assuming there are no mistakes in the code, the smallest value for 16 digits is 1162978044206898255
I've stopped the script at appr n=2.63e9 (2.3 hrs of runtime) and the largest value found so far is 2106319367353202805 (789 solutions). 
20190212, 20:39  #10 
Jan 2017
2·37 Posts 
The solver list hasn't been updated even once after the asterisk task was added, so there's no information about how many people have done so.

20190213, 03:03  #11 
Jun 2003
4693_{10} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
January 2019  Xyzzy  Puzzles  74  20190409 13:34 
February 2018  Xyzzy  Puzzles  27  20180308 06:31 
February 2017  R. Gerbicz  Puzzles  1  20170302 23:13 
February 2016  Xyzzy  Puzzles  1  20160307 02:48 
February 2015  Xyzzy  Puzzles  1  20150302 19:01 