Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

ram khilawan


{ City } vadodra
< Country > india
* Profession * engineer
User No # 81586
Total Questions Posted # 2
Total Answers Posted # 1

Total Answers Posted for My Questions # 0
Total Views for My Questions # 4261

Users Marked my Answers as Correct # 7
Users Marked my Answers as Wrong # 4
Questions / { ram khilawan }
Questions Answers Category Views Company eMail

What is the algorithms of of Geographic information system project?

Image Processing Algorithms 2007

What is Rectification in image prosesing ?

Image Processing Algorithms 2254




Answers / { ram khilawan }

Question { TCS, 13871 }

Write a program that takes a 3 digit number n and finds out
whether the number 2^n + 1 is prime, or if it is not prime
find out its factors.


Answer

#include
#include

int main()
{
int i,n,num,p=1;
cout<<"enter the number";
cin>>n;
num=pow(2,n)+1;
for(i=2;i {
if(num%i==0)
{
p=0;
break;
}
}
if(p==1)
cout<<"prime";
else if(p==0)
{
cout<<"factors are";
for(i=2;i if(num%i==0)
cout< }
getch();
}

Is This Answer Correct ?    7 Yes 4 No