reserve a,b,k,m,n,s for Nat;
reserve c,c1,c2,c3 for Complex;
reserve i,j,z for Integer;
reserve p for Prime;
reserve x for object;

theorem Th48:
  1 <= k <= s implies Problem58Solution(s).k = k * numberQ(s)
  proof
    assume 1 <= k <= s;
    then k in Seg(s);
    hence k*numberQ(s) = numberQ(s) * idseq(s).k by FINSEQ_2:49
    .= Problem58Solution(s).k by VALUED_1:6;
  end;
