1.π/4≈1-1/3+1/5-1/7+… π
10-6
π/4≈1-1/3+1/5-1/7+…
1 -1/3 1/5 -1/7 …
1-11.3.5.7…
int s,n,t; s n t s/n
t
while,for,for!
while
While(fabs(t)> 1e-6)
{Pi=Pi+t;
n=n+2;
s=-s;
t=s/n;
}
#include<math.h>
main()
{
int s;
float ntPi;
t=1Pi=0;n=1.0;S=1;
while((fabs(t))>1e-6)
{Pi=Pi+t;
n=n+2;
s=-s;
t=S/n;
}
Pi=Pi*4;
printf("Pi=%10.6fn"Pi); }
2.fibonacci4012113:
f1=1 (n=1)
f2=1 (n=2)
fn=fn-1+fn-2 (n≥3)
33
fibonacci
f1=1
f2=1
f3=f1+f2=1+1=2
f4=f3+f2=2+1=3
f5=f4+f3=3+2=5
……
For(n=3;n<=40;n++)
{ fn=fn-1+fn-2
printf(“%d\n”,fn);
}
fn=fn-1+fn-2
:
f1=f1+f2
f2=f2+f1
f1=1
f2=1
f3=f2+f1=1+1=2 f1=f1+f2
f4=f3+f2=2+1=3 f2=f2+f1
f5=f4+f3=3+2=5 f1=f1+f2
f6=f5+f4=5+3=8 f2=f2+f1
……
f1=f1+f2 f2=f2+f1
for(i=1; i<=20; i++)
{
printf("%ld %ld "f1f2);
f1=f1+f2;
f2=f2+f1;
}
printf("%ld %ld "f1f2);
f1,f2
f1=f1+f2f3f2=f2+f1f428
main()
{
long int f1f2;
int i;
f1=1;f2=1;
for(i=1; i<=20; i++)
{
printf("%12ld %12ld "f1f2);
if(i%2==0) printf("n");
f1=f1+f2;
f2=f2+f1;
}
}
1 1 2 3
5 8 13 21
34 55 89 144
233 377 610 987
1597 2584 4181 6765
10946 17711 28657 46368
75025 121393 196418 317811
514229 832040 1346269 2178309
3524578 57022887 9227465 14930352
24157817 39088169 63245986 102334155
3.m
1.1
2.1-m
m2m m2m ik(m)m2k(m)i1i=k+1ik+12k
for (i=2;i<m;i++)
if(m%i==0) break;
if(i>=m) printf("%d is a Prime mubern"m);
else printf("%d is not a Prime numbern"m);
}
mmk=sqrt(m+1);
for (i=2;i<=k;i++)
if(m%i==0) break;
if(i>= k +1) printf("%d is a Prime
mubern"m);
else printf("%d is not a Prime numbern"
m); }
4.100200
for
# include <math.h>
main( )
{
int mkin=0;
for(m=101;m<=200;m=m+2)
{
k=sqrt(m);
for (i=2;i<=k;i++)
if (m%i==0) break;
if (i>=k+1)
{printf("%d "m);
n=n+1;}
if(n%10==0) printf("n");
}
printf ("n");
}