The sum of the reciprocals 1 + 1/2 + 1/3 + 1/4 + … is infinite. I’m supposed to write a program that reads in a target and finds the first n such that 1 + 1/2 + 1/3 + … + 1/n > target, but I can’t figure out how to do it. This is where I’m currently at, and the following code just results in an infinite loop. Any help will be greatly appreciated. ```javaimport java.util.Scanner;/** * This program computes how many steps the sum 1 + 1/2 + 1/3 + ... * needs to exceed a given target. */public class ReciprocalSum { public static void main(String[] args) { double sum = 0; int n = 0; Scanner in = new Scanner(System.in); System.out.print("Target: "); double target = in.nextDouble(); while (sum < target) { n++; sum += (1.0 / n); } System.out.println("n: " + n); System.out.println("sum: " + sum); }}```**Program Description:**This Java program calculates how many terms (steps) of the harmonic series \(1 + \frac{1}{2} + \frac{1}{3} + \ldots\) are required until the cumulative sum exceeds a given target value. It uses a `Scanner` to get user input for the target, then iteratively adds the reciprocal of consecutive integers to the sum until this sum surpasses the target.**Code Explanation:**1. **Imports:** - `import java.util.Scanner;`: Imports the `Scanner` class for taking user input.2. **Class and Method:** - `public class ReciprocalSum`: Defines the main class `ReciprocalSum`. - `public static void main(String[] args)`: The main method that executes the program.3. **Variables:** - `double sum = 0;`: Initializes `sum` as a double to accumulate the series. - `int n = 0;`: Initializes `n` to track the number of terms in the series.4. **Scanner:** - Receives the target value from the user.5. **While Loop:** - Checks if the current sum is less than the target. - Increments `n` and adds \( \frac{1}{n} \) to the sum.6. **Output:** - Prints the total number of terms (`n`) and the final sum when the loop exits.```

The sum of the reciprocals 1 + 1/2 + 1/3 + 1/4 + … is infinite. I’m supposed to write a program that reads in a target and finds the first n such that 1 + 1/2 + 1/3 + … + 1/n > target, but I can’t figure out how to do it. This is where I’m currently at, and the following code just results in an infinite loop. Any help will be greatly appreciated.

The sum of the reciprocals 1 + 1/2 + 1/3 + 1/4 + … is infinite. I’m supposed to write a program that reads in a target and finds the first n such that 1 + 1/2 + 1/3 + … + 1/n > target, but I can’t figure out how to do it. This is where I’m currently at, and the following code just results in an infinite loop. Any help will be greatly appreciated.

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

I could really use some help with a problem I got for coding. A screenshot showing an example would help.
In python, write a code that allows the user to input two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The size of each sequence can vary (maybe sequence - 1 has four numbers, and sequence - 2 has seven). The output of this code should be a third sequence that is a combination of both sequences 1 and 2 and is sorted in non-decreasing order. Note: Non-decreasing order means there can be a repeated number in the third sequence (see example 1). A strictly increasing order sequence cannot have repeat numbers at all (see example 3). Remember, all input sequences must be in strictly increasing order! please do this using python, only using while loops. NO language of "break" or "len" please. Hint: we can use three separate lists to solve this code.
Answer only if you are 100% sure . Correct and detailed answer will be Upvoted else downvoted.
You will be given an array A of length n. Write a method to calculate the following value of X using recursion. X = Ao x 7° + A1 x 7' + Az × 7² +. +An-1 x 7"-1 • The recursion can have any number of parameters. You can't use loops or math.pow() or a separate recursive function to calculate 7". The return type should be integer. • The range for n is 1
I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…
Write a program that takes in four positive integers and outputs the number of odd numbers. (Hint: use the modulo operator to determine if a number is odd) Ex: If the input is: 1 2 3 4 the output is: 2 Below is my code so far and I'm getting back unexpected EOF while parsing. I can't figure out what I'm doing wrong. odd_number=[]number_1=int(input())number_2=int(input())number_3=int(input())number_4=int(input())if number_1%2!=0: odd_number.append(number_1)else: passif number_2%2!=0: odd_number.append(number_2)else: passif number_3%2!=0: odd_number.append(number_3)else: passif number_4%2!=0: odd_number.append(number_4)else: passprint(len(odd_number)
Use Java language and the last digit of ID is a 7
CAN THIS PLEASE BE DONE In PYTHON? Input a list of employee names and salaries and store them in parallel arrays. End the input with a sentinel value. The salaries should be floating point numbers Salaries should be input in even hundreds. For example, a salary of 36,510 should be input as 36.5 and a salary of 69,030 should be entered as 69.0. Find the average of all the salaries of the employees. Then find the names and salaries of any employee who's salary is within 5,000 of the average. So if the average is 30,000 and an employee earns 33,000, his/her name would be found. Display the following using proper labels. Save your file using the naming format LASTNAME_FIRSTNAME_M08 FE. Turn in your file by clicking on the Start Here button in the upper right corner of your screen. 1.Display the names and salaries of all the employees. 2. Display the average of all the salaries 3. Display all employees that are within 5,000 range of the average.
Without using arrays(to store the integers/digits) and built-in methods(in doing the reverse), write a program that prompts the user to input an integer from 10,000 to 10,000,000 and then outputs individually the last three digits of the number and the remaining numbers using loops.The remaining numbers will be added to the last three digits. Print the sum as well as the numbers printed in reverse order individually. For example, the program should: Output the last three digits of 23456 as 4 5 6 and the remaining number 23 will be added to 4 5 6, result will be 38 and the reverse will be 8 3; Output the last three digits of 2345526 as 5 2 6 and the remaining number 2345 will be added to 5 2 6, result will be 2358 and the reverse will be 8 5 3 2. SHOW THE CODES IN ANY JAVA APPLICATION LIKE JCRATOR AND ECLIPSE. OUTPUT SHOULD BE LIKE IN THE EXAMPLE. SHOW THE IMAGE PERFORMING THE EXAMPLES
You are going to write a MIPS program that does the following (there is C++ sample code below to explain the logic): • Create an array of 23 INTEGERS, you can put whatever you want in it, but they shouldn’t be sorted. Without using recursion: • Create a procedure to find the largest called findLargest • Create a procedure to find the smallest called findSmallest. • Create procedure called range, which is the difference between largest and smallest (range should call findLargest and findSmallest) • Create a recursive procedure to find the largest (call it findLargestRecursive)
In PYTHON, write a code that allows the user to input two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The size of each sequence can vary. The output of this code should be a third sequence that is a combination of both sequences 1 and 2 and is sorted in non-decreasing order. Note: Non-decreasing order means there can be a repeated number in the third sequence (see example 1). A strictly increasing order sequence cannot have repeat numbers at all (see example 3). PLEASE do this using PYTHON, ONLY using while loops. NO language of "break", "len" or "True" please. Hint: we can use three separate lists to solve this code.