The value of π can be approximated by using the following series:
π=4(1-(1/3)+(1/5)-(1/7)+...+(1/(2n-1))+(1/(2n+1)))
The following program uses this series to find the approximate value of π. However, the statements are in the incorrect order, and there is also a bug in this program. Rearrange the statements and remove the bug so that this program can be used to approximate π.
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
double pi = 0;
long i;
long n;
cin >> n;
cout << "Enter the value of n: ";
cout << endl;
if (i % 2 == 0)
pi = pi + (1 / (2 * i + 1));
else
pi = pi - (1 / (2 * i + 1));
for (i = 0; i < n; i++)
{
pi = 0;
pi = 4 * pi;
}
cout << endl << "pi = " << pi << endl;
return 0;
}
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 2 images
- the odd numbers are the numbers in the sequence 1,3,5,7,9, .... Define the sequence of S - numbers as follows: the first S - number is 1 The second S - number is the sum of the first S - number and the second odd number the third s - number is the sum of the second S- number and the third odd number. the fourth S- number is the sum of the third S- number and the fourth odd number, etc..,... compute the first seven S- numbers. make a note of any patterns you notice. enter the first seven S- numbers as a comma - seperated list: first seven S- numbers = ________________arrow_forwardPlease assist me with these questions.(for the 1st part just complete the bolded area. All other areas have been completed. Then complete the 2nd part 1. Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have the digit 5. For example, if n is 100, the program should output 5, 53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Now, let's trace this algorithm for the input n = 15: For i = 2 to 14, we check if i is prime and if i contains the digit 5. The prime numbers less than 15 are 2, 3, 5, 7, 11, 13. Among these, only 5 contains the digit 5. So, the output for n = 15 is [5]. 2. I also need help with creating JavaScript code for the flowchart provided below. Note: You will have to implement several functions that…arrow_forwardPracticing Loops. Einstein Private Elementary school has three classes in each of its 9 grades. 27 classes in total. It has kindergarten (grade 0) though 8th grade. The school allows parents to pay tuition over the nine-month school year. Tuition for kindergarten is $90 dollars every month. Tuition for the other grades is $50 times the grade level every month. (1st grade is $50 a month, second grade is $100 a month, etc.) Design a programming solution that outputs nine tuition payment bills for each of the 27 classrooms. Each bill must contain the grade number (0 through 8), the classroom number (1 through 3), the month (1 through 9) and the amount of the tuition due. Your output should look something like: Grade Classroom Month Tuition 0 1 1 90 0 1 2 90 0 1 3 90 0 1 4 90 ... 8 3 7 400 8 3…arrow_forward
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY