Ttykuu

What should you do if you miss a job interview (deliberately)?

Is it safe to use olive oil to clean the ear wax?

Why Shazam when there is already Superman?

Why should universal income be universal?

What are the purposes of autoencoders?

What does chmod -u do?

Must Legal Documents Be Siged In Standard Pen Colors?

How can Trident be so inexpensive? Will it orbit Triton or just do a (slow) flyby?

On a tidally locked planet, would time be quantized?

Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?

Where does the bonus feat in the cleric starting package come from?

Why is so much work done on numerical verification of the Riemann Hypothesis?

Is it better practice to read straight from sheet music rather than memorize it?

Not using 's' for he/she/it

C++ debug/print custom type with GDB : the case of nlohmann json library

The screen of my macbook suddenly broken down how can I do to recover

Reverse int within the 32-bit signed integer range: [−2^31, 2^31 − 1]

Offered money to buy a house, seller is asking for more to cover gap between their listing and mortgage owed

Fear of getting stuck on one programming language / technology that is not used in my country

Why is it that I can sometimes guess the next note?

Creepy dinosaur pc game identification

What prevents the use of a multi-segment ILS for non-straight approaches?

What was this official D&D 3.5e Lovecraft-flavored rulebook?

Non-trope happy ending?

c++ sequence calculator x_n+1 = f (x_n) = (1/7)∗((x_n^3)+2)

Fibonacci sequence implementationGrade point average (GPA) calculatorCourse Grade CalculatorAlgebraic calculatorChange calculatorHackerRank: XOR-sequenceTerminal ESC Sequence DecoderSimple Calculator AppsBetter Fibonacci sequence calculationSigma calculator

-1

$begingroup$

example of code

#include <iostream>
using namespace std;
//whitespace package
#include <iomanip>
#include <math.h>
using std::setw;

int main () 

 // n is an array of 101 integers
 long double n[ 101 ];
 double exponent=3;
 double fraction=1.0/7;

 // initialize elements of array n to 0
 for ( int i = 1; i < 100; i++ ) 
 n[ i ] = 0;
 

 //what is input 1?
 cout << "Enter x_1" << endl;
 cin >> n[1];

 //jam ni's into function and loop
 for ( int i = 1; i < 100; i++ ) 

 // set element at location i+1 to f(x)= (fraction)*((x)^exponent + 2)
 n[ i + 1 ] = fraction*(pow( ((n[ i ]) ), exponent ) + 2);
 

 //header
 cout << "Element" << setw( 13 ) << "Value" << endl;

 // output each array element's value
 for ( int j = 1; j < 100; j++ ) 
 cout << setw( 7 )<< j << setw( 13 ) << n[ j ] << endl;
 

 return 0;

output

Element Value
 1 1
 2 0.42857142857
 3 0.29695960016
 4 0.2894553405
 5 0.28917883433
 6 0.28916891514
 7 0.28916855966

...

background: I'm trying to write a simple program that asks what your $x_1$ is and reports $x_1$ to $x_100$ given some series function calculator--like a sequence calculator where $x_n+1 = f(x_n)$. In this example, our function is (1/7)*((x)^3 + 2).

Can you all offer some resources for writing other functions? I have $x_n+1=f(x_n)=(1/7)*((x_n^3)+2)$ right now.

Whenever I look up c++ math functions I get things like how to use the absolute value function, or how to use my cpp file as a function itself, but not information on writing math functions like this.

c++

share|improve this question

edited 11 mins ago

ness

asked 3 hours ago

nessness

11

New contributor

ness is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  ((n[i]) + 2)^2 does a bitwise XOR of ((n[i]+2) with 2, not exponentiation. However, this question is off-topic for Code Review because the code does not work as you intend.
  $endgroup$
  – esote
  2 hours ago
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  okay sorry about that. Tahnkyou so much for pointing out my error. Could you refer me to a site/stack exchange where I can get help with my code?
  $endgroup$
  – ness
  2 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  editted to working code.
  $endgroup$
  – ness
  2 hours ago
  

  
  
  
  

add a comment | 

-1

$begingroup$

example of code

#include <iostream>
using namespace std;
//whitespace package
#include <iomanip>
#include <math.h>
using std::setw;

int main () 

 // n is an array of 101 integers
 long double n[ 101 ];
 double exponent=3;
 double fraction=1.0/7;

 // initialize elements of array n to 0
 for ( int i = 1; i < 100; i++ ) 
 n[ i ] = 0;
 

 //what is input 1?
 cout << "Enter x_1" << endl;
 cin >> n[1];

 //jam ni's into function and loop
 for ( int i = 1; i < 100; i++ ) 

 // set element at location i+1 to f(x)= (fraction)*((x)^exponent + 2)
 n[ i + 1 ] = fraction*(pow( ((n[ i ]) ), exponent ) + 2);
 

 //header
 cout << "Element" << setw( 13 ) << "Value" << endl;

 // output each array element's value
 for ( int j = 1; j < 100; j++ ) 
 cout << setw( 7 )<< j << setw( 13 ) << n[ j ] << endl;
 

 return 0;

output

Element Value
 1 1
 2 0.42857142857
 3 0.29695960016
 4 0.2894553405
 5 0.28917883433
 6 0.28916891514
 7 0.28916855966

...

background: I'm trying to write a simple program that asks what your $x_1$ is and reports $x_1$ to $x_100$ given some series function calculator--like a sequence calculator where $x_n+1 = f(x_n)$. In this example, our function is (1/7)*((x)^3 + 2).

Can you all offer some resources for writing other functions? I have $x_n+1=f(x_n)=(1/7)*((x_n^3)+2)$ right now.

Whenever I look up c++ math functions I get things like how to use the absolute value function, or how to use my cpp file as a function itself, but not information on writing math functions like this.

c++

share|improve this question

edited 11 mins ago

ness

asked 3 hours ago

nessness

11

New contributor

ness is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  ((n[i]) + 2)^2 does a bitwise XOR of ((n[i]+2) with 2, not exponentiation. However, this question is off-topic for Code Review because the code does not work as you intend.
  $endgroup$
  – esote
  2 hours ago
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  okay sorry about that. Tahnkyou so much for pointing out my error. Could you refer me to a site/stack exchange where I can get help with my code?
  $endgroup$
  – ness
  2 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  editted to working code.
  $endgroup$
  – ness
  2 hours ago
  

  
  
  
  

add a comment | 

$begingroup$

example of code

#include <iostream>
using namespace std;
//whitespace package
#include <iomanip>
#include <math.h>
using std::setw;

int main () 

 // n is an array of 101 integers
 long double n[ 101 ];
 double exponent=3;
 double fraction=1.0/7;

 // initialize elements of array n to 0
 for ( int i = 1; i < 100; i++ ) 
 n[ i ] = 0;
 

 //what is input 1?
 cout << "Enter x_1" << endl;
 cin >> n[1];

 //jam ni's into function and loop
 for ( int i = 1; i < 100; i++ ) 

 // set element at location i+1 to f(x)= (fraction)*((x)^exponent + 2)
 n[ i + 1 ] = fraction*(pow( ((n[ i ]) ), exponent ) + 2);
 

 //header
 cout << "Element" << setw( 13 ) << "Value" << endl;

 // output each array element's value
 for ( int j = 1; j < 100; j++ ) 
 cout << setw( 7 )<< j << setw( 13 ) << n[ j ] << endl;
 

 return 0;

output

Element Value
 1 1
 2 0.42857142857
 3 0.29695960016
 4 0.2894553405
 5 0.28917883433
 6 0.28916891514
 7 0.28916855966

...

background: I'm trying to write a simple program that asks what your $x_1$ is and reports $x_1$ to $x_100$ given some series function calculator--like a sequence calculator where $x_n+1 = f(x_n)$. In this example, our function is (1/7)*((x)^3 + 2).

Can you all offer some resources for writing other functions? I have $x_n+1=f(x_n)=(1/7)*((x_n^3)+2)$ right now.

Whenever I look up c++ math functions I get things like how to use the absolute value function, or how to use my cpp file as a function itself, but not information on writing math functions like this.

c++

share|improve this question

edited 11 mins ago

ness

asked 3 hours ago

nessness

11

New contributor

ness is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

#include <iostream>
using namespace std;
//whitespace package
#include <iomanip>
#include <math.h>
using std::setw;

int main () 

 // n is an array of 101 integers
 long double n[ 101 ];
 double exponent=3;
 double fraction=1.0/7;

 // initialize elements of array n to 0
 for ( int i = 1; i < 100; i++ ) 
 n[ i ] = 0;
 

 //what is input 1?
 cout << "Enter x_1" << endl;
 cin >> n[1];

 //jam ni's into function and loop
 for ( int i = 1; i < 100; i++ ) 

 // set element at location i+1 to f(x)= (fraction)*((x)^exponent + 2)
 n[ i + 1 ] = fraction*(pow( ((n[ i ]) ), exponent ) + 2);
 

 //header
 cout << "Element" << setw( 13 ) << "Value" << endl;

 // output each array element's value
 for ( int j = 1; j < 100; j++ ) 
 cout << setw( 7 )<< j << setw( 13 ) << n[ j ] << endl;
 

 return 0;

Element Value
 1 1
 2 0.42857142857
 3 0.29695960016
 4 0.2894553405
 5 0.28917883433
 6 0.28916891514
 7 0.28916855966

share|improve this question

edited 11 mins ago

ness

asked 3 hours ago

nessness

11

New contributor

ness is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|improve this question

edited 11 mins ago

ness

asked 3 hours ago

nessness

11

New contributor

ness is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 3 hours ago

nessness

11

New contributor

ness is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 3 hours ago

nessness

11