Results 1 to 19 of 19
Thread: alternating series sum java help
 03182011, 06:35 AM #1Member
 Join Date
 Mar 2011
 Posts
 27
 Rep Power
 0
alternating series sum java help
For my assignment I have to create a program that calculates the following:
x  x^3/3! + x^5/5!  x^7/7! + ..... +  x^n/n!
Where the user inputs the value of x they want to calculate and inputs the value of n for the maximum exponent value (the higher the exponent the user inputs the more accurate the calculation will be).
Here's my attempt to the problem:
Java Code:import java.io.*; public class s { public static void main(String args[]) throws IOException { BufferedReader keybd = new BufferedReader(new InputStreamReader(System.in)); double x; int n; System.out.print("Input a value for x: "); x = Double.parseDouble(keybd.readLine()); System.out.print("Input max exponent: "); n = Integer.parseInt(keybd.readLine()); int factorial=1; for (int i=2; i<=n; i++) // this for loop finds factorials (ie 5!=120) { factorial = factorial * i; } int exp=1; double sum = 0; for (int i=1; i<=n; i=i+2) { sum = sum + (Math.pow(1,i))*(Math.pow(x,i))/(factorial); // i don't think I did the factorial part correctly. // Also I can't get the alternating between positive and negative. it starts with negative because (1)^1= 1 but the first term of series has to be positive. } System.out.println("The result is: " + sum); } }
Last edited by java157; 03192011 at 12:24 AM.
 03182011, 06:46 AM #2
 Join Date
 Jan 2011
 Location
 Richmond, Virginia
 Posts
 3,069
 Blog Entries
 3
 Rep Power
 11
This wont really work easily without a static method to fomput the factorial.
You can more easily break each expression down to
Java Code:x^((2n + 1)/((2n + 1)!)
Java Code:Math.pow(x, ((2n + 1)/yourFactorialMethod(2n + 1)));
 03182011, 06:50 AM #3Moderator
 Join Date
 Feb 2009
 Location
 New Zealand
 Posts
 4,712
 Rep Power
 15
Does your code compile? If not and you can't understand the messages post them.
If it runs but the runtime behaviour is not what you expect (ie it gives a strange answer or throws an exception), say what it does.
And please use code tags: put [code] at the start of your code and [/code] at the end: that way the indentation is preserved.

// i don't think I did the factorial part correctly.
One way to see to to print out the value produced by your factorial loop.
Java Code:int factorial=1; for (int i=2; i<=n; i++) // this for loop finds factorials (ie 5!=120) { factorial = factorial * i; } [color=blue]System.out.println("n=" + n); System.out.println("n!=" + factorial);[/color]
 03182011, 03:56 PM #4Member
 Join Date
 Mar 2011
 Posts
 27
 Rep Power
 0
 03182011, 05:08 PM #5Member
 Join Date
 Mar 2011
 Posts
 27
 Rep Power
 0
Is it possible to create a for loop within a for loop? Would that work?
 03182011, 06:31 PM #6
Best way to find out is to try it and see for yourself!
db
 03182011, 11:59 PM #7
 Join Date
 Jan 2011
 Location
 Richmond, Virginia
 Posts
 3,069
 Blog Entries
 3
 Rep Power
 11
By the way, @op, were you able to do the last problem?
E(2n + 1)!
If you were this is sort of just a step up from that as I pointed out above.
 03192011, 12:29 AM #8Member
 Join Date
 Mar 2011
 Posts
 27
 Rep Power
 0
 03192011, 12:32 AM #9
 Join Date
 Jan 2011
 Location
 Richmond, Virginia
 Posts
 3,069
 Blog Entries
 3
 Rep Power
 11
yes. One class can have many methods, I am wanting you to have one of the methods in the class be a factorial method. Below I have created a static method to print hello.
Java Code:public class StaticHello{ public static void hello(){ System.out.println("Hello, World"); } public static void main(String[] args){ hello(); } }
 03192011, 01:15 AM #10Member
 Join Date
 Mar 2011
 Posts
 27
 Rep Power
 0
Ok I think I get it now, but under the factorial method it says "the local variable n may not have initialized". Says something similar for FactorialMethod (check comments within the code):
Java Code:import java.io.*; public class s{ public static void main(String args[]) throws IOException { BufferedReader keybd = new BufferedReader(new InputStreamReader(System.in)); double x; int n; System.out.print("Input a value for x: "); x = Double.parseDouble(keybd.readLine()); System.out.print("Input max exponent: "); n = Integer.parseInt(keybd.readLine()); double sum; for (int i=0; i<=n; i++) { sum += (Math.pow(1,i))*(Math.pow(x,((2*n + 1))/((2*n + 1)FactorialMethod); // "FactorialMethod cannot be resolved to a variable" } System.out.println("The result is: " + sum); } public static int FactorialMethod;{ int n; int factorial=1; for (int i=2; i<=n; i++) //"the local variable n may not have initialized" { factorial *= i; } } }
 03192011, 01:18 AM #11
 Join Date
 Jan 2011
 Location
 Richmond, Virginia
 Posts
 3,069
 Blog Entries
 3
 Rep Power
 11
close, to help you out a bit more I will make a static method to determine if a number is prime.
Java Code:public class IsPrime{ public static boolean isPrime(int n){ boolean flag = true; //assume the number is prime for(int i = 2; i < n; i++){ if(n % i == 0){//if number is evenly divisble by i, switch flag to false, end loop. flag = false; break; } } return flag;//return the flag(true if nothing divides evenly into n, otherwise returns false) } public static void main(String[] args){ System.out.println(isPrime(10)); System.out.println(isPrime(11)); } }
 03192011, 01:52 AM #12Member
 Join Date
 Mar 2011
 Posts
 27
 Rep Power
 0
It still says n can't be initialized to a variable:
Java Code:public static int FactorialMethod;{ int n; boolean flag = true; int factorial=1; for (int i=2; i<=n; i++) // "n has not been initialized to variable" { if ((n % i == 0)){ flag = false; break; } else { factorial *= i; } } } }
 03192011, 01:58 AM #13
 Join Date
 Jan 2011
 Location
 Richmond, Virginia
 Posts
 3,069
 Blog Entries
 3
 Rep Power
 11
Your method is incorrect(you don't need a flag to find the factorial)
The reason I used the flag was to show you a bit more complex example of a static method(one that takes an argument)
Compare my method declaration and yours
Mine:
Java Code:public static boolean isPrime(int n)
Java Code:public static int FactorialMethod;
 03192011, 02:15 AM #14Member
 Join Date
 Mar 2011
 Posts
 27
 Rep Power
 0
Here it says "Syntax error on 'FactorialMethod', delete this token"
Java Code:sum += (Math.pow(1,i))*(Math.pow(x,2*n + 1))/((2*n + 1)FactorialMethod);
Here it says. "This method must return a result of type boolean"
Java Code:public static boolean FactorialMethod(int n){
Last edited by java157; 03192011 at 02:24 AM.
 03192011, 02:33 AM #15
 Join Date
 Jan 2011
 Location
 Richmond, Virginia
 Posts
 3,069
 Blog Entries
 3
 Rep Power
 11
Ill give you the factorial method since you seem to be genuinely trying but I want you to understand how it works, instead of simply copying and pasting it.
Java Code:public static int factorial(int n){ //it's public and static, it returns and int, and takes an int as an argument for(int i = n; i > 0; i){ sum *= i; } }
Once you find the bugs you want to work on the actual heart of the problem.
Which really breaks down to
Math.pow(x, ((2n + 1)/(factorial(2n + 1))));
 03202011, 12:57 AM #16Member
 Join Date
 Mar 2011
 Posts
 27
 Rep Power
 0
 03202011, 03:14 AM #17
 Join Date
 Jan 2011
 Location
 Richmond, Virginia
 Posts
 3,069
 Blog Entries
 3
 Rep Power
 11
Did you get the whole problem solved?
 03202011, 04:34 AM #18Member
 Join Date
 Mar 2011
 Posts
 27
 Rep Power
 0
Yes. The program works fine and calculates correct answers
 03202011, 04:41 AM #19
 Join Date
 Jan 2011
 Location
 Richmond, Virginia
 Posts
 3,069
 Blog Entries
 3
 Rep Power
 11
Similar Threads

Alternating Transparency Based on Double Variable
By YellowPainting in forum Java 2DReplies: 2Last Post: 11052010, 09:59 PM 
Perrin series
By moamen in forum New To JavaReplies: 6Last Post: 12042009, 06:27 PM 
Generating Fibonacci Series with a Multithreaded Java Program
By firesauce in forum Threads and SynchronizationReplies: 1Last Post: 10202009, 07:26 AM 
Alternating Sum
By ScaryJello in forum New To JavaReplies: 6Last Post: 10132009, 09:18 AM 
strange alternating array
By jarvis in forum New To JavaReplies: 2Last Post: 04232009, 09:42 AM
Bookmarks