//convert addition to successor.
#include <iostream>
using namespace std;
int succ(int a){
return a+1;}
int add(int n, int m){
if (m==0)
return n;
else
return add(succ(n),m-1);
}
int main(){
add(3,4);
cout <<add(3,4);
return 0;
}
//mod function
#include <iostream>
using namespace std;
int mod(int a,int b){
if (a<b)
return a;
else
return mod(a-b,b);
}
int main(){
int a,b;
cout<<”put a =”;
cin>>a;
cout<<”put b =”;
cin>>b;
mod(a,b);
cout<<”the result = “<<mod(a,b)<<’\n’;
return 0;
}
//factorial function
#include <iostream>
using namespace std;
int fac(int n){
if(n==0)
return 1;
else
return n*fac(n-1);
}
int main(){
int m;
cout <<”m=”;
cin>>m;
// int z=
fac(m);
cout<<fac(m);
return (0);}
//power function
#include <iostream>
using namespace std;
pow(int a, int b){
if(b==0)
return 0;
else if (b==1)
return a;
else
return a*pow(a,b-1);
}
int main(){
int a,b;
cout<<”enter a =”;
cin>>a;
cout<<”enter b =”;
cin>>b;
pow(a,b);
cout<<”the result = “<<pow(a,b)<<’\n’;
return 0;
}
//function convert multiply to sum//
#include <iostream>
using namespace std;
int mul(int a ,int b){
if ((a==0)|(b==0))
return 0;
//else if(b==0)
// return 0;
else
//{ if(a>b)
return a+mul(a,b-1);
// else
// return b+mul(a-1,b);}
}
int main(){
int n,m ;
cout<<”enter n =”;
cin>>n;
cout<<”enter m =”;
cin>>m;
mul(n,m);
cout << “the result = “<<mul(n,m)<<’\n’;
return 0;
}