Let P(n) be "a postage of n cents can be formed using 5-cent and 17-cent stamps if n is greater than 63".Basis step: P(64) is true since 64 cents postage can be formed with one 5-cent and one 17-cent stamp.Inductive step: Assume that P(n) is true, that is, postage of n cents can be formed using 5-cent and 17-cent stamps. We will show how to form postage of n + 1 cents. By the inductive hypothesis postage of n cents can be formed using 5-cent and 17-cent stamps. If this included a 17-cent stamp, replace this 17-cent stamp with two 5-cent stamps to obtain n + 1 cents postage. Otherwise, only 5-cent stamps were used and n 65. Hence there are at least three 5-cent stamps forming n cents. Remove three of these 5-cent stamps and replace them with two 17-cent stamps to obtain n + 1 cents postage.Hence P(n + 1) is true.
Answer:
I don't know if this is right output is {1,3}
Explanation:
Since you have not provided the choices wherein I will have to choose from to arrive at an answer, I will just explain to you the concept revolving around a hosted blog software. Hosted blog software are basically installed by the owner of the web server in which among its famous platforms is the Blogger.
Answer:
Replace /* Your code goes here */ with
for(i =0; i<NUM_VALS; i++)
{
printf("%d", origList[i]*offsetAmount[i]);
printf(";");
}
Explanation:
The first line is an iteration statement iterates from 0 till the last element in origList and offsetAmount
for(i =0; i<NUM_VALS; i++)
{
This line calculates and print the product of element in origList and its corresponding element in offsetAmount
printf("%d", origList[i]*offsetAmount[i]);
This line prints a semicolon after the product has been calculated and printed
printf(";");
Iteration ends here
}
