Several papers have investigated sequences which have no k-term arithmetic progressions, finding bounds on their density and looking at sequences generated by greedy algorithms. Rankin in 1960 ...
Last month, I started to explore when to use simple sequences and when to use complex sequences. Part of creating the correct sequence lies in the proper use of technology. For example, let’s look at ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback