Consider the following sequence, defined from n=2 to 15 (inclusive). Pn=n2−1. Produce a list named primes which only contains va
1 answer:
You might be interested in
Answer:
Explanation:
To write a C program for the above problem:
#include <stdio.h>
int main()
{
// we define the variable to get the annual income
float AnIncome;
// to get the annual income from the user
printf("Enter your annual income here: ");
scanf("%f", &Anincome);
// This is the function to test the annual income
float printIt(x){
//we test the amount inputted now
if (x>= 90000){
printf("Congratulations on your income\n"); // This is the congratulatory message
}
if (x<=0){
// This statement is included to avoid putting zero as annual income
printf("Annual Income cannot be zero or less than zero\n");
}
else{
printf("You WILL make $90,000, if you keep going.\n");
}
}
printIt(AnIncome);
return 0;
}
Attached is the image for a flow chat for the program
