given any two numbers k,j(adsbygoogle = window.adsbygoogle || []).push({});

what is the largest sequence of integers such that the sum of any k consecutive terms is negative and the sum of any j consecutive terms is positive

and

how may we find a subset containing k of the first n numbers such that out of all subsets with k elements, this subset has the smallest arithmetic progression with common difference j. and out of all subsets with k elements, does this subset contain the largest arithmetic progression for some other integer?

ideas would be very much appreciated

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Sequence of integers and arithmetic progressions

Loading...

Similar Threads for Sequence integers arithmetic | Date |
---|---|

I Prove the sequence is exact: 0 → ker(f) → V → im(f) → 0 | Dec 4, 2016 |

I Trouble with exact sequence | Sep 15, 2016 |

Pseudorandom integer sequence having at least 15 adjacent differences > 36 | May 29, 2010 |

Help deriving integer sequence formula | Jan 16, 2010 |

Sequence of ratios of primes and integers | Mar 15, 2007 |

**Physics Forums - The Fusion of Science and Community**