No math library, and only allowed to use 'while' loops INPUTCALCULATIONOUTPUTn = 1e = 11n= 2e = 1+ 1/1!2n = 3e = 1+ 1/1! + 1/2!2.5n = 50e = 1 + 1/1! + 1/2! + ... + 1/49!2.7182818284590455NOTE: You are not allowed to use any built-in factorial function in yoursolution (you are not allowed to import the math library for this problem)Examples of factorial: 5! = 1*2*3*4*53! = 1*2*3 PROBLEM: Computing e as an infinite seriesYour task is to write a computer program that computes an approximation for eusing the formula given below:1+1!11111e = 1 ++ ... +6!---2!3!4!5!п!The input to the problem is a positive integer, n, that represents the number ofterms you wish to sum in your approximation. The output is the resultingcalcuation of that summation. For example, if:++

Answered: Image /qna-images/answer/82a5a401-c3f7-46c6-8aa9-14d054f2d9d0.jpg

Your task is to write a computer program that computes an approximation for e using the formula given below: 1 e = 1 + 1! 1 1 + + 3! 1 + 5! 1 + + 6! ... 2! 4! The input to the problem is a positive integer, n, that represents the number of terms you wish to sum in your approximation. The output is the resulting calcuation of that summation. For example, if:

Your task is to write a computer program that computes an approximation for e using the formula given below: 1 e = 1 + 1! 1 1 + + 3! 1 + 5! 1 + + 6! ... 2! 4! The input to the problem is a positive integer, n, that represents the number of terms you wish to sum in your approximation. The output is the resulting calcuation of that summation. For example, if:

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a program that calculates the equivalent resistance of a circuit. n electrical resistors with resistance values R1, R2,.., Rn are said to be connected in parallel if the same voltage is applied across each. Their equivalent resistance Reg is related to the values R1, R2, ..., Rn by: 1 1 1 1 + +...+ R R R, R. "eq Write a program that prompts the user to enter the resistance of n resistors. The user should be prompted continuously by using a while loop until a zero or negative value is entered (the program should count the number of resistors n entered by the user and store the values in an array). Use another separate loop to print the resistance values entered by the user and the equivalent resistance Reg. Test your program with R1= 1 kn, R2= 2 kn, R3= 4 kQ and R4= 8 kQ.
Question} Using python solve the below problem: Little Coder is trying to learn exponents. He is especially interested in a number raised to the power of itself. Head Coder being his mentor has decided to give him a two-player game to play. The game is as follows: You are given n piles of stones. The piles have a_1, a_2 ... a_n number of stones. Each player on his/her turn can remove x number of stones where x = n^n (for some natural number n > 0) from any one pile. The player who is unable to move loses. Head Coder is playing this game with the Little Coder and being senior he gives the first move to the Little Coder Input: 1 1 4 Output: Little Coder
Description A mathmatician Goldbach's conjecture: any even number(larger than 2) can divide into two prime number’s sum.But some even numbers can divide into many pairs of two prime numbers’ sum. Example:10 =3+7, 10=5+5, 10 can divide into two pairs of two prime number. Input Input consist a positive even number n(4<=n<=32766). Output Print the value of how many pairs are this even number can be divided into. Sample Input 1 1234 Sample Output 1 25
Your task: The sum of entries that are divisible by 8. For example if the input numbers are [-1, -8, -32, 16, -5, -4, 12, 0], the printed result should be -24.
For any integer n > 0, n! is defined as the product n * n - 1 * n - 2 ... * 2 * 1 0! is defined to be 1. It is sometimes useful to have a closed- form definition instead; for this purpose, an approximation can be used. R. W. Gosper proposed the following such approximation formula: Create a program that prompts the user to enter an integer n , uses Gosper’s formula to approximate n!, and then displays the result. The message display-ing the result should look something like this: 5! equals approximately 119.97003
I wrote the following program for this problem and it works, but is too slow on big numbers. How could i make it faster? Problem: We want to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, we can represent 121 as 121=111+11+–1. Help us to find the least number of digits 1 in such sum. Input: The first line of the input contains integer n (1 ≤ n < 1015). Output: Print expected minimal number of digits 1. (ex. input:121, output:6) My solution: import java.util.Scanner; public class Main { staticlong[] en=newlong[]{1,11,111,1111,11111,111111,1111111,11111111,111111111,1111111111, 11111111111L,111111111111L,1111111111111L,11111111111111L,111111111111111L,1111111111111111L}; public static void main(String[] args){ Scanner scanner =new Scanner(System.in); System.out.println(rekisto(scanner.nextLong())); } static long rekisto(long s){ if(s==0){ return 0; } int dolzina…
The binomial coefficient (n, k) is an integer equal to (n, k) = n! / [k! (n – k)!] Note that n! = n(n – 1)(n – 2) … (1) and that 0! = 1. a) Using this form for the binomial coefficient, write a Python user-defined function binomial(n,k) that calculates the binomial coefficient for given n and k. Make sure your function returns the answer in the form of an integer (not a float) and gives the correct value of 1 for the case where k = 0. Use phyton code to answer,
Solve in python: When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This adjustment can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by dividing all values by the largest value. The input begins with an integer indicating the number of floating-point values that follow. Output each floating-point value with two digits after the decimal point, which can be achieved as follows: print(f'{your_value:.2f}') Ex: If the input is: 5 30.0 50.0 10.0 100.0 65.0 the output is: 0.30 0.50 0.10 1.00 0.65 The 5 indicates that there are five floating-point values in the list, namely 30.0, 50.0, 10.0, 100.0, and 65.0. 100.0 is the largest value in the list, so each value is divided by 100.0.
Maclaurin series are a type of Mathematic series expansion in which all terms are nonnegative real powers of the variable. The Maclaurin series expansion for sin(x) is given by the following formula that is valid for all real values of x such that x is in radians (Note that: radians(x) = x X 1/180): sin(x) = x - 3! 5! Implement a Java program to compute the value of Maclaurin series expansion for sin(x) where x is a nonnegative real value according to the following: a. Write a java method named Factorial that takes as an argument an integer value n and returns the mathematical factorial n! of n as a long value such that: n! = n x (n – 1) x (n – 2) ... × 2 x 1 b. In the main method: i. Ask the user to enter the value of the angle x to be calculate in the Maclaurin series expansion for sin(x) as given above. x Should be entered in degrees, i.e., 0° < x< 360° and then converted into radians using the formula: (radians(x) = x × 1/180). ii. Ask the user to enter the number of terms to be…
Write a Python (or R) program that asks the user to enter an integer (X), then: Determines if X is prime or not • If X is not prime, compute and print the factors of that integer X • Evaluate and print the equation Y=8X²+ 1, for X values from -5 to 5 using the range function and for loop
Given a Binary Number B, find its decimal equivalent. Example 1: Input: B = 10001000 Output: 136 Example 2: Input: B = 101100 Output: 44 Your Task: You don't need to read or print anything. Your task is to complete the function binary_to_decimal() which takes the binary number as string input parameter and returns its decimal equivalent. Expected Time Complexity: 0(K* Log(K)) where K is number of bits in binary number. Expected Space Complexity: 0(1)
Write a function that finds digital root of given number. Digital root is the number which is equal to sum of all digits in number. This process is repeated until result is 1-digit number: Ex: 357=3+5+7=15 15=1+5 = 6=Answer WRITE IN PYTHON PLEASE