#include
#include
using std::cin;
using std::cout;
using std::endl;
using std::tolower;
long factorial(const int& N);
int main()
{
int N = 0; //factorial of N
char command = 'n';
do
{
cout << "Enter a number to calculate factorial: ";
cin >> N;
cout << endl << "Factorial of " << N << " is: " << factorial(N) << endl;
cout << "Do you want to continue (y/n)?";
cin >> command;
cout << endl;
} while ('y' == tolower(command));
system("PAUSE");
return 0;
}
long factorial(const int& N)
{
if (N == 0)
{
return 1;
}
else
{
return (N * factorial(N - 1));
}
}
look ont the back of th packet
The nth even number is 2n...
100000
Line the numbers up from lowest to highest, and find the middle number. Let n be "how many numbers there are". To find the middle number, find the "(n+1)/2"th number. If this gives you a whole number, the median is the corresponding number in the number line. If "(n+1)/2" gives you a decimal, such as 21.5th number, you need to find the average between the 21st and 22nd number.
difference
look ont the back of th packet
The nth even number is 2n...
Sis - Sister
To answer this question we need the centuries. "Th" is not a word or number.
100000
TH = town highway, generally followed by a number, as in TH 25
Line the numbers up from lowest to highest, and find the middle number. Let n be "how many numbers there are". To find the middle number, find the "(n+1)/2"th number. If this gives you a whole number, the median is the corresponding number in the number line. If "(n+1)/2" gives you a decimal, such as 21.5th number, you need to find the average between the 21st and 22nd number.
One.
difference
To find the GCF and the LCM you have to first at least try to use prime factorization. So use factor trees. Or for the LCM find th least common multiples of the number.
No number has that prime factorization since 4 isn't prime.
the number of pt,n,e- make each atom diff.oxygen as an example the number at th etop of an periodic table on th left is the atomatic # of protons.