Final answer:
The student's tasks include writing programming solutions to generate a Fibonacci series, calculate the sum of a series, approximate the natural logarithm of 2, and list prime numbers up to a user-given limit.
Step-by-step explanation:
To fulfill the assignments related to the Fibonacci series, sum of series, natural logarithm approximation, and prime numbers, different programming tasks must be accomplished each requiring separate logic and control structures.
Printing the Fibonacci Series
The Fibonacci series can be generated using a loop that starts with the initial two terms, 0 and 1, and calculates subsequent terms as the sum of the previous two. The series is printed until the nth term is reached, where n is provided by the user.
Calculating the Sum of A Series
To calculate the sum of the series 1 + 1/2 + 1/3 + ... + 1/n, a loop is employed to iteratively add the reciprocal of each integer up to n, again entered by the user.
Computing the Natural Logarithm of 2
Approximation of the natural logarithm of 2 is done using the series 1 - 1/2 + 1/3 - 1/4 + ... + (-1)^(n+1)/n up to n terms. An alternating series is used where the sign changes with each term, and the counter determines the term's value as well as its sign.
Printing All Prime Numbers
A program to print all prime numbers between 1 to n involves checking each number within this range for primality - numbers that have no divisors other than 1 and themselves - and printing it if the check is true.