#include<stdio.h> #include<conio.h> void main() { int n; printf("Enter any number"); scanf("%d",&n); sum=((n*(n+1))/2); printf("The sum of first 100 natural numbers is\t%d",sum); }
First you will need to have some basic programming knowledge. You can use this to help make the program that is needed.
Write an. Algorthim. To. Find the. Sum. Of. First15 natural. Numbers
#include<iostream> int main() { int i=0; while(i++<10) std::cout<<i*i<<std::endl; }
Just write a method or function that calculates the LCM for two numbers at a time. Then calculate the LCM for the first two numbers, get the LCM of the result with the third number, etc.Just write a method or function that calculates the LCM for two numbers at a time. Then calculate the LCM for the first two numbers, get the LCM of the result with the third number, etc.Just write a method or function that calculates the LCM for two numbers at a time. Then calculate the LCM for the first two numbers, get the LCM of the result with the third number, etc.Just write a method or function that calculates the LCM for two numbers at a time. Then calculate the LCM for the first two numbers, get the LCM of the result with the third number, etc.
write a vb program to find the magic square
write an assembly language program to find sum of N numbers
program to find maximum of two numbers using pointers
VBnet program to find the prime numbers between 100 to 200?
For first find an example program.
First you will need to have some basic programming knowledge. You can use this to help make the program that is needed.
k
Write an. Algorthim. To. Find the. Sum. Of. First15 natural. Numbers
This would require some computer knowledge. It can make it easier to find out the prime numbers without figuring it out in your head.
i need this answer
Please visit http://talentsealed.blogspot.com/2009/10/to-find-sqaure-of-numbers-using-c.htmlfor the answer.
Since there is an infinite set of prime numbers the answer would be infinity.
#include<iostream> int main() { int i=0; while(i++<10) std::cout<<i*i<<std::endl; }