Posted by **best** on Tuesday, June 18, 2013 at 11:32pm.

A smooth partition of the integer n is a set of positive integers a 1 ,a 2 ,…a k such that

1. k is a positive integer,

2. a 1 ≤a 2 ≤⋯≤a k ,

3. ∑ k i=1 a i =n, and

4. a k −a 1 ≤1.

Determine how many smooth partitions there are of the integer 250.

Note: The definition given above is not standard terminology.

## Answer This Question

## Related Questions

- geometry - A smooth partition of the integer n is a set of positive integers a1,...
- Math (algebra) - Suppose a and b are positive integers satisfying 1≤a&#...
- Maths - Suppose a and b are positive integers satisfying 1≤a≤31, 1&#...
- Maths Please Help - Let A=a1,a2,…,ak and B=b1,b2,…,bj be sequences of positive ...
- algebra 1 help please - 4) a student score is 83 and 91 on her first two quizzes...
- Math - Find the largest possible degree n≤1000 of a polynomial p(x) such ...
- algebra - Call a positive integer N ≥ 2 “special” if for every k such that...
- plls heeeeeeelp math - How many ordered pairs of positive integers 1≤k&#...
- heeeeeeeeelp math - How many ordered pairs of positive integers 1≤k≤...
- math - How many ordered pairs of positive integers 1≤k≤n≤50 ...

More Related Questions