• 0
Sign in to follow this  
Followers 0
phil1882

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.

0

Share this post


Link to post
Share on other sites

1 answer to this question

  • 0

Posted (edited)

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
0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0

  • Recently Browsing   0 members

    No registered users viewing this page.