Write a public method named findSum that takes a a parameter named n of type int. If n is less than 1 the method returns -1 otherwise it returns a number that is the result of applying the following formula to i values ranging from 1 to n: Note :E is the symbol for summation.

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
icon
Related questions
Question

java

**Creating the `findSum` Method**

**Objective:** Write a public method named `findSum` that takes a parameter named `n` of type `int`. If `n` is less than 1, the method returns -1; otherwise, it returns a number that is the result of applying the following formula to `i` values ranging from 1 to `n`.

**Note:** The symbol Σ (summation) is used in the formula.

**Formula Representation:**

\[ \sum_{i=1}^{n} \left( \frac{n(n+1)}{2} \right) \]

- **Explanation of the Formula:** 
  - The formula provided within the summation symbol (Σ) calculates the sum of the first `n` natural numbers.
  - The term \(\frac{n(n+1)}{2}\) is derived from the arithmetic series sum formula for the first `n` natural numbers.

Here is a breakdown of the formula:

- **Summation (Σ):** This notation indicates that you sum the values of the given expression for `i` ranging from 1 to `n`.
- **Expression:** \(\frac{n(n+1)}{2}\)
  - `n` is the given number.
  - The numerator `n(n+1)` calculates the product of `n` and `n+1`.
  - Dividing by 2 gives the sum of the first `n` natural numbers.

**Instructions for Implementation:**

- **Step 1:** First, check if `n` is less than 1. If so, return -1.
- **Step 2:** Otherwise, calculate the sum using the formula \(\frac{n(n+1)}{2}\).
- **Step 3:** Return the computed sum.

By implementing these steps, the `findSum` method will accurately compute the required sum or return -1 if the input is invalid (i.e., less than 1).
Transcribed Image Text:**Creating the `findSum` Method** **Objective:** Write a public method named `findSum` that takes a parameter named `n` of type `int`. If `n` is less than 1, the method returns -1; otherwise, it returns a number that is the result of applying the following formula to `i` values ranging from 1 to `n`. **Note:** The symbol Σ (summation) is used in the formula. **Formula Representation:** \[ \sum_{i=1}^{n} \left( \frac{n(n+1)}{2} \right) \] - **Explanation of the Formula:** - The formula provided within the summation symbol (Σ) calculates the sum of the first `n` natural numbers. - The term \(\frac{n(n+1)}{2}\) is derived from the arithmetic series sum formula for the first `n` natural numbers. Here is a breakdown of the formula: - **Summation (Σ):** This notation indicates that you sum the values of the given expression for `i` ranging from 1 to `n`. - **Expression:** \(\frac{n(n+1)}{2}\) - `n` is the given number. - The numerator `n(n+1)` calculates the product of `n` and `n+1`. - Dividing by 2 gives the sum of the first `n` natural numbers. **Instructions for Implementation:** - **Step 1:** First, check if `n` is less than 1. If so, return -1. - **Step 2:** Otherwise, calculate the sum using the formula \(\frac{n(n+1)}{2}\). - **Step 3:** Return the computed sum. By implementing these steps, the `findSum` method will accurately compute the required sum or return -1 if the input is invalid (i.e., less than 1).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Introduction to computer system
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education