用VB求数列1,3,7,15......的前30项

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

PrivateSubCommand1_Click()a=2b=1Dot=a/bs=s+tc=aa=a+bb=cn=n+1LoopUntiln=20PrintsEndSub再问：那我还想问下求1-1/2

添加一个文本框输入前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

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

PrivateSubForm_Click()Dima(1To40)AsLongFori=1To40Ifi=1Ori=2Thena(i)=1Elsea(i)=a(i-2)+a(i-1)EndIfPrin

#include#includemain(void){intn,i;printf("请输入n的值\n");scanf("%d",&n);intsum1=1,sum2=2,sum;for(i=3;i

Private Sub Command1_Click()Dim a As Long, b As Long, c

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:"

这样的题目主要是利用Mod运算,能被13整除,n就加1,代码如下：PrivateSubCommand1_Click()Fori=1To9999IfiMod13=0Thenn=n+1EndIfNexti

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

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

DimSAsDouble,IAsInteger,TAsIntegerT=1ForI=1To100S=S+T*1/(2*I-1)T=-TNextMsgBoxS*4你的问题应该还有一个条件,就是计算到什么

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

PrivateSubCommand1_Click()DimnAsLongDimiAsLongDimsumAsDoublen=Val(Text1.Text)sum=1#Fori=2Ton'sum=sum

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