Develop a Java application to approximate e using the following formula: Design an e calculator by using the following: e = 1 + 1/1! + 1/2! + 1/3! + ... + 1/n! Using a method, set up the denominator as N factorial, using the following formula: n! = n(n-1)(n-2) … 2 * 1 The value for n! is then to be returned to the calling method. Display the approximation value for e for n = 1000 … 2000. Things needed in the Java program: Start with an initial value for n, and then increment it in steps of 100 Use Java expressions to set up the above-given formulas Set up 3 methods: one to do N factorial the other to approximate e the main() method as the driver routine Use System.out.print and/or System.out.println to do the outputting

Develop a Java application to approximate e using the following formula: Design an e calculator by using the following: e = 1 + 1/1! + 1/2! + 1/3! + ... + 1/n! Using a method, set up the denominator as N factorial, using the following formula: n! = n(n-1)(n-2) … 2 * 1 The value for n! is then to be returned to the calling method. Display the approximation value for e for n = 1000 … 2000. Things needed in the Java program: Start with an initial value for n, and then increment it in steps of 100 Use Java expressions to set up the above-given formulas Set up 3 methods: one to do N factorial the other to approximate e the main() method as the driver routine Use System.out.print and/or System.out.println to do the outputting

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

code in java pls Summary: Given integer values for red, green, and blue, subtract the gray from each value. Computers represent color by combining the sub-colors red, green, and blue (rgb). Each sub-color's value can range from 0 to 255. Thus (255, 0, 0) is bright red, (130, 0, 130) is a medium purple, (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (In other words, equal amounts of red, green, blue yield gray). Given values for red, green, and blue, remove the gray part. Ex: If the input is: 130 50 130 the output is: 80 0 80 Find the smallest value, and then subtract it from all three values, thus removing the gray.
Write in Java: Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. You will need to write a second function to reverse the string. Ex: If the input is: 6 the output is: 110 Your program must define and call the following two methods. The method integerToReverseBinary() should return a string of 1's and 0's representing the integer in binary (in reverse). The method reverseString() should return a string representing the input string in reverse. public static String integerToReverseBinary(int integerValue)public static String reverseString(String inputString) LabProgram.java: import java.util.Scanner; public class LabProgram {/* Define your method here */ public static void main(String[] args) {/* Type your code…
In JAVA language, write a program to input an integer p from the user and then print the count of digit 0 in the integer p. The entered value of p will be always positive.
use JAVA to write the code. : Euclid’s algorithm for finding the greatest common divisor (gdc) of two numbers The algorithm: given two numbers, n1 and n2: Divide n1 by n2 and let r be the remainder. If the remainder r is 0, the algorithm is finished and the answer is n2. (If the remainder is 1, the numbers are mutually prime and we are done-see below.) Set n1 to the value of n2, set n2 to the value of r, and go back to step 1. Entering 0 for one of the values is bad. It should work for the other value, but you have to figure out which is OK and which is bad. Catch this problem as it happens and make the user enter another value until they enter an acceptable one. Give an appropriate error message if this happens.
Write a Java program that repeatedly prompts your user for two integer numbers and uses a recursive method to calculate the product of those two numbers. The program should display the result of the call to the recursive method. The program will terminate when either of the two numbers entered by the user is equal to zero (0). Do not use the multiplication operator ( * ) in your proposed solution.
Write an application that reads an integer value from the user and prints the sum ofall even integers between 2 and the input value, inclusive. Print an error message ifthe input value is less than 2. Use Java. Sample Run Examples: Example 1:the user enters 14Output: Sum: 56Example 2:the user enters 1Output: Error number must be greater than 1
I have two matrices, for example, as follows: Matrix 1: 2 4 3 1 6 7 5 8 9 Matrix 2: 5 5 3 1 6 6 5 3 8 Write a program to check if these two matrices are the same (i.e. to see if each number in matrix 1 equals to its corresponding number (same row same column) in matrix 2). If they are the same, display “same matrices”; otherwise display “different matrices”. Using java programming
Instruction: Write a Java program that reads a positive, non zero integer as input and checks if the integer is deficient, perfect, or abundant. A positive, non-zero integer, N, is said to be perfect it the sum of its positive proper divisors (i.e., the positive integers, other than N itself, that divide N exactly) is equal to the number itself. If this sum is less than N, the number is said to be deficient. It the sum is greater than N, the number is said to be abundant. The first few perfect numbers are 6, 28, 496, and 8128. | Illustrations: Number 6. 28 For example, the number 6 is perfect, since 6 = 1 + 2 + 3, the number 8 is deficient, since 8>1 + 2+ 4, while the nurmber 12 is abundant, since 12<1+2+3+4+ 6. | Factors of the number less than itself | Sum of Factors 3. 2. 1 14, 7, 4, 2, 1 6. 28 Sample Input/Output: Depicled below are sample oulputs when the program is execuled (Ihe ilems in bold characters are input from the user, while the items in bold italic are calculated and…
please code in python You place a pawn at the top left corner of an n-by-n chess board, labeled (0,0). For each move, you have a choice: move the pawn down a single space, or move the pawn down one space and right one space. That is, if the pawn is at position (i,j), you can move the pawn to (i+1,j) or (i+1, j+1). Ask the user for the size of a chessboard, n (integer). Find the number of different paths starting from (0,0) that the pawn could take to reach each position on the chess board. For example, there are two different paths the pawn can take to reach (2,1). Look at the diagrams below to convince yourself of this. You can see the four paths that you can take by move 2. Start -> Move 1 -> Move 2 (0,0) -> (1,0) -> (2,1) (0,0) -> (1,0) -> (2,0) (0,0) -> (1,1) -> (2,1) (0,0) -> (1,1) -> (2,2) Print the board with the number of ways to reach each square labeled as shown below. For example: Enter a board size: 4 1 0 0 0 1 1 0 0 1 2 1 0 1 3 3 1
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.
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…
Code language Java 1, Add a print statement to say “Multiplication Table” and then prompt theuser to enter an integer. Your program should then prints “times table” for thenumbers from 1 to the given integer (inclusive). That is, for input n, you would printa table of n rows (lines) each with n columns, where the cell at row i and columnj contains the value i × j. You do need separate rows, but don’t worry about thecolumns lining up nicely yet. 2. Add a print statement to say “Prime Testing”.Using the integer entered by the user above, print out all the prime numbers between2 and the number squared. E.g., if the user types 12 for the multiplication table part,you should print all the prime numbers that are not larger than 144.All integers are either prime or composite. A prime number is one that has no integerfactors other than itself or one. Examples are 2, 3, 5, 7, 11, 13, . . .. A compositenumber, by contrast, has multiple factors. Examples are 4, 6, 12, 15, 18, 21, . . ..Testing…