#来自在线整数序列百科全书的问候!http://oeis.org/搜索:id:a198748显示第1-1页,共1页%一号A198748%S A198748 5,9,4,7,3,0,0,2,9,2,2,8,2,2,7,8,3,1,5,0,1,1,5,0,8,4,2,6,0,7,9,7,7,%电话A198748 1,1,8,3,6,3,3,1,5,8,8,4,4,3,4,4,9,9,6,7,6,2,9,9,0,9,5,0,6,2,1,8,1,%U A198748 7,2,9,3,0,6,1,3,8,8,2,5,5,1,1,9,0,3,2,7,0,3,5,0,4,5,0,4,6,6,2%N A198748最小x>0的十进制展开式,给出f(x)+f(2x)+f(3x)的绝对最小值,其中f(x)=sin(x)-cos(x)。%C A198748有关相关序列的指南,请参阅A198745。%邮箱A198748 x=5.9473002922822783150115084260797711836331。。。%e A198748最小值=-4.05824487647797618374998236242336948409。。。%t A198748 f【t】:=正弦【t】-余弦【t】%t A198748 n=3;s[t\u]:=和[f[k*t],{k,1,n}]%t A198748 x=N[最小化[s[t],t],110];u=零件[x,1]%t A198748 v=t/。第[x,2]部分%t A198748实数[u](*A198747*)%t A198748实数[v](*A198748*)%t A198748绘图[s[t],{t,-2pi,2pi},绘图范围->{-4.1,3}]%Y A198748比照A198745。%K A198748无,cons%O A198748 1,1%2011年10月29日,A198748克拉克•金伯利#根据OEIS最终用户许可协议提供内容:http://oeis.org/LICENSE