Question: (smallest) integer solve for inequality

Hi all,

 

C:=2:

solve({K*(K-1)>6*C-2,K>0},K,useassumptions) assuming K::point;

It does not exacly give me 'integer'.

for C from 2 to 10 do

isolve({K*(K-1)>6*C-2,K>0},a);

end do;

gives me pretty much what I am expected to see. The positive smallest (ceiling) numbers, 4,5,6,6,7,7,8,8,9.

 

Is there a way to obtain a "neater" output?

Say I just want a sequence (list) of 4,5,6,6,7,7,8,8,9.

Thanks,

 

Casper

Please Wait...