can be approximated by using the following infinite series: =4- π=4 1 1 3 5 1 1 7 9 - +..) 11 Write a program that prints out two versions of the approximation one that goes out to a denominator of 13 and one that goes out of a denominator of 15. Note you will want to use 1.0 for your numerators. In my code I used a decimal version for all of these integers.

can be approximated by using the following infinite series: =4- π=4 1 1 3 5 1 1 7 9 - +..) 11 Write a program that prints out two versions of the approximation one that goes out to a denominator of 13 and one that goes out of a denominator of 15. Note you will want to use 1.0 for your numerators. In my code I used a decimal version for all of these integers.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

Write a program that reads in three integers and then determines and prints the largest and the smallest integers in the group. Use only the programming techniques you have learned in this chapter.
how to solve this problem, really need help, please. Complete this program that reads an integer n and prints the following diamond pattern with 2 * n - 1 asterisks at its widest point. This is the pattern when n is 3: --*-- -***- ***** -***- --*--
Code the follow.
How do I write my computer program that shows the current population at 78,000. And there are 365 days in a year. A baby born every 7 seconds, someone dies every 13 seconds and an one new immigrant every 45 seconds. Print the next 5 years population
You are given an integer, N. Your task is to print an alphabet rangoli of size N. (Rangoli is a form of Indian folk art based on creation of patterns.) Different sizes of alphabet rangoli are shown below: #size 3 ----C---- --c-b-c-- c-b-a-b-c --c-b-c-- ----C---- #size 5 ------e-d-e-- ----e-d-c-d-e---- --e-d-c-b-c-d-e-- e-d-c-b-a-b-c-d-e --e-d-c-b-c-d-e-- ----e-d-c-d-e---- e-d-e---- ---- #size 10 --j- -j-i-j- --j-i-h-i-j-- ---j-i-h-g-h-i-j- --j-i-h-g-f-g-h-i-j- -j-i-h-g-f-e-f-g-h-i-j-- ------j-i-h-g-f-e-d-e-f-g-h-i-j-- ----j-i-h-g-f-e-d-c-d-e-f-g-h-i-j--- --j-i-h-g-f-e-d-c-b-c-d-e-f-g-h-i-j-- j-i-h-g-f-e-d-c-b-a-b-c-d-e-f-g-h-i-j --j-i-h-g-f-e-d-c-b-c-d-e-f-g-h-i-j-- ----j-i-h-g-f-e-d-c-d-e-f-g-h-i-j-- -j-i-h-g-f-e-d-e-f-g-h-i-j- -j-i-h-g-f-e-f-g-h-i-j- ---j-i-h-g-f-g-h-i-j- --j-i-h-g-h-i-j- -j-i-h-i-j- j-i-j- The center of the rangoli has the first alphabet letter a, and the boundary has the Nth alphabet letter (in alphabetical order). Eunction Descrintion
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…
Problem 7: Guess the price of the car!? You will implement a variant of the number guessing game we played in lecture. In this variant, you will ask the user to guess the price of a $42,500 car. Let's assume that the player knows the price of the car is rounded to the nearest $500. If a player's guess is not exactly correct, your program will tell them they are either too high or too low. The player will get as many guesses as they need to guess the price of the $42,500 car. However they will only win the game if they used 5 or fewer guesses. Here are two examples of how the program should work for both cases: Guess the price and win the prize! Enter your guess:50000 Too high! Enter your guess:40000 Too low! Enter your guess:45000 Too high! Enter your guess:42500 You won the car! Guess the price and win the prize! Enter your guess:46000 Too high! Enter your guess:45000 Too high! Enter your guess:44000 Too high! Enter your guess:43000 Too high! Enter your guess:42000 Too low! Enter your…
how to fix the code so it doesn't show (2-9) since it is not an armstrong number
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.
. Write a program that generates and prints 50 random integers, each between 3 and 6. .Write a program that generates a random number, x, between 1 and 50, a random number y between 2 and 5, and computes x". .Write a program that generates a random number between 1 and 10 and prints your name that many times. .Write a program that generates a random decimal number between 1 and 10 with two decimal places of accuracy. Examples are 1.23, 3.45, 9.80, and 5.00.
i need the answer quickly
Write a program to check the divisibility of two numbers. Use the concept of default argument here. If the number is not divisible, check whether the first number is a prime or not, using the previously defined divisibility check function.