Answer:
Explanation:
a binary number is a number expressed in the base-2 numeral system or binary numeral system
Answer:
#part 1
#read the amount
amount=int(input("enter the amount:"))
#find the dollars
doll=int(amount/100)
// find the cents
cent=amount%100
#print output
print("{} dollars and {} cents.".format(doll,cent))
#part 2
#read a floating point
temperature=float(input("enter the temperature:"))
#part 3
#read a word
firstWord=input("enter a word:")
Explanation:
In part 1, read amount and the find the dollars with the help of "/" operator. Then find the cents with "%" operator and print both.In part 2, read a point and cast it to float then assign it to variable "temperature".In part 3,Read a word and assign it to variable "firstWord".
Output:
enter the amount:4321
43 dollars and 21 cents.
enter the temperature:12.5
enter a word:hello
Answer:
B. having lunch with a friend
Explanation:
Lifelong learning can be defined as a continuous, self-motivated, and self-initiated learning activity that is typically focused on personal or professional development. Thus, it's a form of education that is undertaken throughout life with the sole aim of pursuing knowledge, competencies, and skills for either personal or professional growth and development, especially after acquiring a formal education.
Some examples of lifelong learning includes the following;
I. Reading a trade magazine.
II. Reviewing a textbook.
III. Studying an encyclopedia.
The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.
int recursiveOddSum(int n) {
if(2n-1==1) return 1;
return (2n-1) + recursiveOddSum(n-1);
}
To prove the correctness of this algorithm by induction, we start from the base case as usual:
by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).
Now we can assume that 
returns indeed the sum of the first n-1 odd numbers, and we have to proof that 
returns the sum of the first n odd numbers. By the recursive logic, we have
and by induction, is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, is the sum of the first n odd numbers, as required:
1. Start up Open Office.Org.
2. Click on File >> New >> Labels.
3. In the label dialog box, click on the brand box. This will allow you to choose the type of paper that you use.
4. Select the type of document that you want. The usual standard is Avery, but feel free to explore and discover what you like.
5. Select if you want a single label, a document, and any other options. Some of the things you might want to do are:
- Create a variety of labels for folders or drawers
- Create a sheet of address labels
- Create decorative labels
6. Click New Document. Here, you see a sheet of blank labels.
7. Create the type of format/placement that you want for your labels. Once you are happy with it, copy it to the rest of the labels.
8. Fill your labels with necessary information.
9. Print them out.
