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)
“Under the dominion of an idea, which possesses the minds of multitudes, as civil freedom, or the religious sentiment, the power of persons are no longer subjects of calculation. A nation of men unanimously bent on freedom, or conquest, can easily confound the arithmetic of statists, and achieve extravagant actions, out of all proportion to their means; as, the Greeks, the Saracens, the Swiss, the Americans, and the French have done.”
—Ralph Waldo Emerson (1803–1882)