The Babylonian
1. Make a guess at the answer (you can pick n/2 as your initial guess).
2. Compute r = n /guess
3. Set guess = (guess + r) / 2
4. Go back to step 2 for as many iterations as necessary. The more that steps 2 and 3 are repeated, the closer guess will become to the square root of n.
Write a
Want to see the full answer?
Check out a sample textbook solutionChapter 2 Solutions
Problem Solving with C++ (10th Edition)
Additional Engineering Textbook Solutions
C How to Program (8th Edition)
C++ How to Program (10th Edition)
Introduction to Programming Using Visual Basic (10th Edition)
Differential Equations: Computing and Modeling (5th Edition), Edwards, Penney & Calvis
Java: An Introduction to Problem Solving and Programming (7th Edition)
Starting Out With Visual Basic (8th Edition)
- Numeric Triangle Pattern Based on the example given on the previous module, create a program that replicated the triangle pattern shown. Try to look at the examples closely and think of an algorithm that replicates the outputs. Let's see if you still look at Triangle problems the same way after this problem. Input: Integer value n. Output: A triangle based on the inputted value of n.arrow_forwardWrite an algorithm in pseudocode for the following problem: Write a program that reads a series of daily high temperatures from the keyboard and then prints to the screen the number of days that each high was achieved. Assume that the temperatures will fall between -40 and 110, inclusive. You'll print the temperature and then the number of days for each temperature that was the high at least once. So your output will be in two columns. The key to this is that you'll have an array where the indices of the array represent the temperatures and the contents are the number of days where that temperature was the high.arrow_forwardMake a program that asks for a width, and then prints a pyramid of that width. The pyramid must be of odd width, and if the user enters an even number the program should print "Please enter an odd number" and ask again. (It is ok if the program gives an error if the user enters a non-number). Example: Please enter the pyramid width 10Please enter an odd numberPlease enter the pyramid width 14Please enter an odd numberPlease enter the pyramid width 13 * *** ***** ******* ********* ************************ The first line should have 1 asterisk, the second 3, then 5, 7, 9 etc. The number of spaces before starting the asterisks is (n−i)/2 Where n is the width of the pyramid and i is the number of asterixes in the current line. Note that this is always a whole number, as n and i are odd and hence (n-i) is even.arrow_forward
- Statistics are often calculated with varying amounts of input data. Write a program that takes any number of integers as input, and outputs the average and max. Ex: If the input is: 15 20 0 5 the output is: 10 20 Note: For output, round the average to the nearest integer. simple pythonarrow_forwardTask 15 Write a Python program that takes a number and tells if it is a perfect number or not. [The input number has to be an INTEGER] Perfect Number: An integer number is said to be a perfect number if its factors, including 1 but not the number itself, sum to the number. Example01: Input: 6 Output: 6 is a perfect number Explanation: 6 have 4 divisors: 1, 2, 3, and 6. If we add all factors except itself, 6 = 1 + 2 + 3.arrow_forwardWrite a program that plays a number guessing game with a Human user. The Human user will think of a number between 1 and 100, inclusive. The program will make guesses and the user will tell the program to guess higher or lower. A sample run of the program might look like this: Ready to play (y/n)? y Think of a number between 1 and 100. My guess is 50. Enter 'l' if your number is lower, 'h' if it is higher, 'c' if it is correct: h My guess is 75. Enter 'l' if your number is lower, 'h' if it is higher, 'c' if it is correct: h My guess is 88. Enter 'l' if your number is lower, 'h' if it is higher, 'c' if it is correct: l My guess is 81. Enter 'l' if your number is lower, 'h' if it is higher, 'c' if it is correct: c Great! Do you want to play again (y/n)? y Think of a number between 1 and 100. My guess is 50. Enter 'l' if your number is lower, 'h' if it is higher, 'c' if it is correct: l My guess is 25. Enter 'l' if your number is lower, 'h' if it is higher, 'c' if it is correct: h My…arrow_forward
- A positive integer is called a perfect number if it is equal to thesum of all of its positive divisors, excluding itself. For example, 6 is the first perfectnumber because 6 = 3 + 2 + 1. The next is 28 = 14 + 7 + 4 + 2 + 1. Thereare four perfect numbers < 10,000. Write a program to find all these four numbers.arrow_forwardWrite a program that inputs a number and checks whether it is a perfect number or not. A perfect number is the number that is numerically equal to the sum of its divisors. For example, 6 is a perfect number because the divisors of 6 are 1, 2, 3 and 1+2+3=6arrow_forwardOur local bank has many customers who save their change and bring it in for deposit. Write a general program to interact with their customers and determine the value of the collection of coins. The algorithm is given as follows: Get and display the customer's initials Get the count of each kind of coin (dollars($), quarter, dime, nickels, cents) • Compute the total value in cents Find the value in dollars and change Display the value in dollars and change Select one:arrow_forward
- Eulers number e is used as the base of natural logarithm. It may be approximated using the formula e=1/0!+1/1!+1/2!…1/(n-1)!+1/n! When n is sufficiently large. Write a program that approximates e using a loop that terminates when the difference between the two successive values of e is less than 0.0000001.arrow_forwardA Fibonacci sequence is a sequence of numbers where each successivenumber is the sum of the previous two. The classic Fibonacci sequencebegins: 1, 1, 2, 3, 5, 8, 13, .... Write a program that computes the nthFibonacci number where n is a value input by the user. For example, ifn = 6, then the result is 8.arrow_forwardFind the first 10 square numbers that are greater than Long.MAX_VALUE. A square number is a number in the form of n2. For example, 4, 9,and 16 are square numbers. Find an efficient approach to run your program fast.arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education