Covering By and Partitioning Into Arithmetic Progressions
- Find minimal ln such that any set of n residues modulo p can be covered by an arithmetic progression of the length ln.
- For a given set S of integers find the minimal number of arithmetic progressions that cover S
- For a given set S of integers find the minimal number of nonoverlapping arithmetic progressions that cover S
- Find the number of ways to partition {1, ..., n} into arithmetic progressions.
- Find the number of ways to partition {1, ..., n} into arithmetic progressions of length at least 2 with the same period.
- See also Covering system
Read more about this topic: Problems Involving Arithmetic Progressions
Famous quotes containing the words covering and/or arithmetic:
“You had to have seen the corpses lying there in front of the school—the men with their caps covering their faces—to know the meaning of class hatred and the spirit of revenge.”
—Alfred Döblin (1878–1957)
“O! O! another stroke! that makes the third.
He stabs me to the heart against my wish.
If that be so, thy state of health is poor;
But thine arithmetic is quite correct.”
—A.E. (Alfred Edward)