20180113, 17:01  #12 
"Forget I exist"
Jul 2009
Dumbassville
2^{3}×1,049 Posts 
For anyone still stuck on what I mean, in the cases of n not being 1 mod 3 and endpoints that are additive inverses mod 3 we get the following:
In squares/ even powers, bases that are 1 or 2 mod 3 show up a multiple of 3 times between the base types. In cases raised to odd exponents the two base types must be equally mixed to fit such endpoint pairs. This set of circumstances may not be so uncommon T_n divides by 3, 2/3 times and of the reduced cases of endpoints without ordering, 1/3 of cases are such endpoint cases. 
20180114, 17:13  #13 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
2^{3}·7·107 Posts 
https://ibb.co/jMDpCR
Above is the image of 296. 256 has to be an end. Any other issues? 
20180114, 17:28  #14  
"Forget I exist"
Jul 2009
Dumbassville
8392_{10} Posts 
Quote:


20180114, 18:30  #15 
"Forget I exist"
Jul 2009
Dumbassville
20C8_{16} Posts 
Edit: might be able to use screen magnification.
Last fiddled with by science_man_88 on 20180114 at 18:30 
20180114, 22:19  #16 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
13550_{8} Posts 
You can download and zoom in. Sorry the graph program I am using doesn't cope very well.

20180114, 23:43  #17  
"Forget I exist"
Jul 2009
Dumbassville
2^{3}·1,049 Posts 
Quote:
Code:
my(b=vector(148,i,select(r>sqrtn(r+2*(i1)+1,3)==sqrtnint(r+2*(i1)+1,3),2*[1..148])));b Last fiddled with by science_man_88 on 20180115 at 00:20 Reason: Added script. Added better script 

20180116, 17:02  #18 
"Forget I exist"
Jul 2009
Dumbassville
10000011001000_{2} Posts 
Correction( post 12),
Even powers: bases 1 mod 3 and 2 mod 3 show up a mod 3 times together, a being the mod 3 of the endpoints. Odd powers: base 1 mod 3 shows up a mod 3 times more than base 2 mod 3, or base 2 mod 3 shows up a mod 3 more times than base 1 mod 3. Composite powers: must follow rules for factors as powers. 
20180117, 21:15  #19 
"Robert Gerbicz"
Oct 2005
Hungary
11^{2}×13 Posts 
Returning to the original squaresum problem,
a non trivial result: the sequence is infinite, for n=(71*25^k1)/2 there is a solution for every k>=0 integer. For given "a" sequence that is a solution for n. let us define T(c)=25*a[1]+c,25*a[2]c,25*a[3]+c,25*a[4]c,...,25*a[n]+(1)^(n+1)*c and R(a)=a[n],a[n1],..,a[2],a[1] the reversing of a[]. Then obviously if abs(c)<=12 then in T(c) and in R(T(c)) we see different integers, and if we consider all these sequences for c=12...,12 then it will give the permutation of [13,25*n+12]. Moreover in these sequences the sum of adjacent terms is square, because we see (25*a(k)+c)+(25*a(k+1)+c)=25*(a(k)+a(k+1)), and here a(k)+a(k+1) was square. What is left to use the integers from [1,12] to glue these 25 sequences so that we see squaresums at the sequence endpoints (and in the constructed new pairs). And this is possible: if n is odd, a(1)=1 and a(n)=3, then b=1,T(1),T(1),R(T(7)),T(6),T(6),R(T(0)),11,R(T(5)),5,4,12,T(12),T(12),\ R(T(7)),T(8),R(T(2)),T(3),9,7,T(4),T(4),10,6,T(5),R(T(11)),2,T(2),8,T(3),\ R(T(9)),R(T(9)),T(10),T(10),T(11),R(T(8)),3 is a good sequence, and this is a Hamiltonian cycle, constructed in such a way, that b(1)=1 and b(n)=3. So we can use induction for the new sequence. We need only to find a good sequence, an example for n=35: v=[1,8,28,21,4,32,17,19,6,30,34,15,10,26,23,13,12,24,25,11,5,20,29,35,14,2,7,18,31,33,16,9,27,22,3]; This gives a solution for n=25*35+12=887, what gives a solution for n=25*887+12=22187 etc. An explicit formula for the length z(n)=(71*25^n1)/2. trivial code to get b from a. Code:
F(a,b,c,ty)={local(n,i,v);if(ty==0,v=[c],n=length(b);v=25*b+c*vector(n,i,(1)^(i+1)); if(ty==1,v=Vecrev(v)));return(concat(a,v))} fun_odd(a)={local(r,w,n); n=length(a); if(n%2==0,print("Not implemented even n.");return()); if(a[1]!=1a[n]!=3,print("Invalid input.");return()); w=a;r=[]; r=F(r,w,1,0); r=F(r,w,1,1); r=F(r,w,1,1); r=F(r,w,7,1); r=F(r,w,6,1); r=F(r,w,6,1); r=F(r,w,0,1); r=F(r,w,11,0); r=F(r,w,5,1); r=F(r,w,5,0); r=F(r,w,4,0); r=F(r,w,12,0); r=F(r,w,12,1); r=F(r,w,12,1); r=F(r,w,7,1); r=F(r,w,8,1); r=F(r,w,2,1); r=F(r,w,3,1); r=F(r,w,9,0); r=F(r,w,7,0); r=F(r,w,4,1); r=F(r,w,4,1); r=F(r,w,10,0); r=F(r,w,6,0); r=F(r,w,5,1); r=F(r,w,11,1); r=F(r,w,2,0); r=F(r,w,2,1); r=F(r,w,8,0); r=F(r,w,3,1); r=F(r,w,9,1); r=F(r,w,9,1); r=F(r,w,10,1); r=F(r,w,10,1); r=F(r,w,11,1); r=F(r,w,8,1); r=F(r,w,3,0); return(r)} v=[1,8,28,21,4,32,17,19,6,30,34,15,10,26,23,13,12,24,25,11,5,20,29,35,14,2,7,18,31,33,16,9,27,22,3]; fun_odd(v) It could be possible to extend this idea to prove that every n>=25 is in the sequence, I haven't reached this, for example a nice blocking subproblem was this: for n>1 there is no such sequence where a(i)i is even for all i. Last fiddled with by R. Gerbicz on 20180117 at 21:19 Reason: typo 
20180117, 22:06  #20 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
2^{3}·7·107 Posts 
If I understand correctly you gave an example based upon a known solution for n=35. This led to solutions for n=(71*25^k1)/2.
Given a solution for n=37 you would be able to generate solutions for (75*25^k1)/2 in the same way. It also looks like 25 should be replaceable with any odd square. I am not quite certain why 9 wouldn't qualify for this. I need to give this more thought. I suppose 25 relies on there being a solution that connects the 25 sequences together. This wouldn't happen for 9. Is this guaranteed to work for any odd square >=25? 
20180117, 22:26  #21  
"Robert Gerbicz"
Oct 2005
Hungary
1573_{10} Posts 
Quote:
Quote:
Using only odd squares and the above construction is not enough, since sum(k>1,1/k^2)<1, so the density is smaller than 1, not every integer will be covered. The main following idea (from me) was to use two sequences a0 and a1, one for length of n, and one for length (n+1), with this you could build a solution for length=e^2*n+res for all res=[(e^21)/2,(3*e^21)/2) if you can give the base cases for all [N..e^2*N) then with induction there is a solution for all n>=N. The main problem is that to use induction you need the same parity of the position of k in a0() and in a1(), and it is hard to maintain this in the induction. Maybe one could reach say 25<=n<=81*2^20 *easily* using e=9, but in the induction it will be collapsing. 

20180121, 17:09  #22 
"Robert Gerbicz"
Oct 2005
Hungary
11^{2}×13 Posts 
There is a solution for every n>=25 !
Giving a Hamiltonian cycle for all n>=32, see my linked code: https://drive.google.com/file/d/1XpY...hHdPA708/view somewhat large file ( 5.7 MB ), but the actual code is pretty short, using a constant memory, and fast algorithm in O(n*log(n)) time. [it could be faster but using O(n) memory] n=10000000 is solved in roughly 5 seconds examples: Code:
gerbicz@gerbicz:~/gmp6.1.2$ gcc o squares squares.c lm gerbicz@gerbicz:~/gmp6.1.2$ ./squares n 10000 out "seq.txt" Computed the sequence for n=10000 in 0 sec. gerbicz@gerbicz:~/gmp6.1.2$ ./squares n 100 screen 1 80 64 36 85 84 16 48 73 71 50 94 75 69 100 96 4 5 76 24 97 72 49 95 74 47 17 19 45 99 22 59 62 82 39 25 11 70 51 30 91 53 28 93 7 57 43 78 66 34 87 13 68 32 89 55 9 27 54 90 31 18 46 98 2 14 86 35 65 79 42 58 63 81 40 41 23 26 38 83 61 60 21 15 10 6 3 33 67 77 92 52 29 20 44 37 12 88 56 8 Computed the sequence for n=100 in 0 sec. gerbicz@gerbicz:~/gmp6.1.2$ we are using a recursion. The above ideas were quite good, call seq0 and seq1 a nice pair of sequence iff length(seq0)=n and length(seq1)=n+1 and for all k<=n it is true that if k=seq0[p]=seq1[q] then pq is even (in other word p+q is even), so we see the same terms in the same position's parity. Using such a pair of sequence I'm giving a nice pair of sequence for every 49*n+res, where res=24..72, this a complete residue system for mod=49, and with a larger precomputed table I'll give a solution for every n=41..2032. This completes the proof for n>=41, for smaller n values using another lookup table. The construction is similar to the above strategy, just using two(!) sequences, one with length=n and one with length=n+1, lets define T(c,0)=49*seq0[1]+c,49*seq0[2]c,..,49*seq0[n]+(1)^(n+1)*c T(c,1)=49*seq1[1]+c,49*seq1[2]c,..,49*seq1[n+1]+(1)^(n+2)*c so T(c,1) is longer by one. For each c=24..24 use exactly one of them or its reversed sequence, use the remaining [1,24] integers to glue/attach them at the sequence endpoints, so we are seeing only square pairsums. It was a somewhat harder problem as above, because we needed two glues: one for N=49*n+res and one for N=49*n+res+1 so that the resulted pair of sequence is still nice, to make sure the induction will work. Observe that it is determined what we should choose T(c,0) or T(c,1) for each c (so here you have no real choice), because these contain the same integers, and we know the extra term in T(c,1), why(?), because if in seq1 the (n+1) is in position k, then k==n+1 mod 2. Suprisingly my code found these glues in roughly 1 second, and the basic sequences in 1 hour (could be maybe somewhat faster) using one thread. In code data[][][] contains the glues, the very large S[][] the basic sequences for small n values. Note that in all sequences a[1]=1 and for even n: a[n]=8, for odd n: a[n]=3, and we maintain this property also, so it'll be a Hamiltonian cycle. Furthermore, the code checks (in several ways) that the output sequence is good, for example checking that sum(i=1,n,a[i]^3)=(n*(n+1)/2)^2 mod 2^64 is true, and the square tests are done for all consecutive pair sums. If we'd need just Hamiltonian path then we can use 25*n+res in the recursion: use a[1]=1 and for even n: a[n]=2, for odd n: a[n]=3. (this results smaller tables). And for 9*n+res there is absolutely nothing in our plate. Last fiddled with by R. Gerbicz on 20180121 at 17:21 Reason: typos 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
The SquareDiff problem  firejuggler  Puzzles  1  20180124 23:27 
Square root of 3  Damian  Math  3  20100101 01:56 
Square of Primes  davar55  Puzzles  9  20080521 12:54 
red square  Fusion_power  Puzzles  14  20080425 11:37 
How often is 2^p1 squarefree  ZetaFlux  Math  16  20051214 06:55 