vb数列求没一列的和

vb具体语法不会啊.大致用pascal写一下把a=1;b=1;whilei再问：你这里么用wend哇！我先试试看你能不能做出来！再答：pascal里的循环语句和vb不一样，没有wend。。。我用vb写

添加一个文本框输入前N项的N值,再添加一个命令按钮即可PrivateFunctionF(NAsLong)AsLongIfN>2ThenF=F(N-1)+F(N-2)ElseF=1EndIfEndFun

PrivateFunctionGetNum(ByValiCountAsLong)DimiAsLongReDima(iCount)AsLonga(1)=1:a(2)=2:a(3)=3Fori=4ToiC

PrivateSubCommand1_Click()Dimn1&,m1&,m&,n&,r&n1=InputBox("输入n1")m1=InputBox("输入m1")Ifm1>n1Then'为了求最小

PrivateSubCommand1_Click()DimnAsInteger,阶乘项AsLong,阶乘和AsLongDon=Val(InputBox("请输入阶乘的项数（N≤8）"))LoopUnt

dimf()asdoublen=inputbox("in","NO.")redimf(n)asdoublef(1)=1f(2)=1fori=3tonf(i)=f(i-1)+f(i-2)nextprin

functionsum(nasinteger)dima(30)asintegerdimsasintegers=0a(1)=0a(2)=0a(3)=1fori=4to30a(i)=a(i-1)+a(i-

DimnAsIntegerDimmAsIntegerDimiAsIntegerDimjAsIntegerDima(30)AsInteger'确定数组的范围（）里的数即为最大可储存数+1PrivateS

Dima(35)AsLongDimiAsInteger=0,jAsInteger=0Fori=0To35a(i)=Nothing'''''''''''''''''''''''''''初始化Nexta(

PrivateSubForm_Click()DimnAsIntegern=Val(InputBox("请输入N:"))Dima,bAsLonga=1:b=1Fori=1TonPrinta&""&b&"

OptionExplicitDimf(40)AsLongPrivateSubCommand1_Click()DimiAsByteDimsAsLongf(1)=1f(2)=1s=2Print"No1:"

非递归：staticvoidf(intn){longp1=1,p2=1,p=1;for(inti=1;i

PrivateFunctionbq(ByValsAsLong)AsLongSelectCasesCase1bq=1Case2bq=1CaseIs>=3bq=bq(s-1)+bq(s-2)EndSele

回答过了啊……Dimf1,f2,f3AsLongDimi,jAsIntegerf1=1f2=1j=3        &n

楼上的程序会慢死人的.给一个非递归实现.functionFibonacci(byvalnasLong)asLongdiml1aslong,l2aslong,l3aslongl1=1l2=1ifn

PrivateFunctionbq(ByValsAsLong)AsLongSelectCasesCase1bq=1Case2bq=1CaseIs>=3bq=bq(s-1)+bq(s-2)EndSele

先写两个数列.PublicSubaa()DimabAsStringDimi,jAsIntegerDima,bAsInteger'素数序列Fori=1To1000Forj=1ToiIfiModj=0An

1

递归法和循环法分别如下：PrivateFunctionFibonacci1(nAsInteger)AsLongDimaAsInteger,bAsIntegerIfn=1Orn=2ThenFibonac

i从1到n,对i^2求和,即1^2+2^2+3^2+……+n^2结果是n(n+1)(2n+1)/6n^3-(n-1)^3=3n^2-3n+1(n-1)^3-(n-2)^3=3(n-1)^2-3(n-1