Jump to content
BrainDen.com - Brain Teasers
  • 0

erdos decrepency conjecture


Question

heres an alternate version that i came up with,

place the digits 1-n where n is 4 such that no consecutive digit of any step value, starting at step value, repeats.

here's an example where n is 2.

0 1 0 2 1 0 2 1 2   0   1   ?   

1 2 3 4 5 6 7 8 9 10 11 12

here starting from 1 and going a step of 1, there are no repeats. starting from 2 and going a step of 2, no repeats, and so on. However there is no way to get 12 without repeating.

your task is to find the max value for 4.

Link to post
Share on other sites

2 answers to this question

Recommended Posts

  • 0

since it been a couple weeks without even a guess, I'll go ahead and post my answer and see if anyone can do better. i get 59.

0 1 0 2 0 3 0 1 0   3   0   2   0   1   0   3   0   1   0   2   0   1   0   4  0   1   0   2   0   3   0    1   0   3   0   2   0   1  0   4   0   1   0   2   0   1   0    3   0   1  

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 

0    2   0   1   0   4   0   1   0   ?

51 52 53 54 55 56 57 58 59 60

 

Edited by phil1882
Link to post
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...
  • Recently Browsing   0 members

    No registered users viewing this page.

×
×
  • Create New...