c++ sequence calculator x_n+1 = f (x_n)Fibonacci sequence implementationGrade point average (GPA) calculatorCourse Grade CalculatorAlgebraic calculatorChange calculatorHackerRank: XOR-sequenceTerminal ESC Sequence DecoderSimple Calculator AppsBetter Fibonacci sequence calculationSigma calculator
How to explain what's wrong with this application of the chain rule?
C++ debug of nlohmann json using GDB
Not using 's' for he/she/it
Why electric field inside a cavity of a non-conducting sphere not zero?
lightning-datatable row number error
Fear of getting stuck on one programming language / technology that is not used in my country
How did Rebekah know that Esau was planning to kill his brother in Genesis 27:42?
The screen of my macbook suddenly broken down how can I do to recover
Why is it that I can sometimes guess the next note?
Yosemite Fire Rings - What to Expect?
Biological Blimps: Propulsion
Non-trope happy ending?
How can I block email signup overlays or javascript popups in Safari?
Pre-mixing cryogenic fuels and using only one fuel tank
What was this official D&D 3.5e Lovecraft-flavored rulebook?
What is this called? Old film camera viewer?
Loading commands from file
Are paving bricks differently sized for sand bedding vs mortar bedding?
Why can Carol Danvers change her suit colours in the first place?
Is the U.S. Code copyrighted by the Government?
What does routing an IP address mean?
Pre-modern battle - command it, or fight in it?
Store Credit Card Information in Password Manager?
Freedom of speech and where it applies
c++ sequence calculator x_n+1 = f (x_n)
Fibonacci sequence implementationGrade point average (GPA) calculatorCourse Grade CalculatorAlgebraic calculatorChange calculatorHackerRank: XOR-sequenceTerminal ESC Sequence DecoderSimple Calculator AppsBetter Fibonacci sequence calculationSigma calculator
$begingroup$
I am super out of practice with writing programs and even the stuff I kindof remember is wholly out-dated. 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. like a sequence calculator where x_n+1 = f (x_n).
An example of my code is below. I'm not sure what is wrong with it. I have f(x)=(x+2)^2 rn. I'm writing it to help me with my real analysis class later on.
thanks in advance!
#include <iostream>
using namespace std;
//whitespace package
#include <iomanip>
using std::setw;
int main ()
// n is an array of 100 integers
double n[ 100 ];
// 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++ )
n[ i + 1 ] = ((n[ i ]) + 2)^2; // set element at location i+1 to f(x)= (x+2)^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;
c++
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$
add a comment |
$begingroup$
I am super out of practice with writing programs and even the stuff I kindof remember is wholly out-dated. 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. like a sequence calculator where x_n+1 = f (x_n).
An example of my code is below. I'm not sure what is wrong with it. I have f(x)=(x+2)^2 rn. I'm writing it to help me with my real analysis class later on.
thanks in advance!
#include <iostream>
using namespace std;
//whitespace package
#include <iomanip>
using std::setw;
int main ()
// n is an array of 100 integers
double n[ 100 ];
// 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++ )
n[ i + 1 ] = ((n[ i ]) + 2)^2; // set element at location i+1 to f(x)= (x+2)^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;
c++
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$
add a comment |
$begingroup$
I am super out of practice with writing programs and even the stuff I kindof remember is wholly out-dated. 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. like a sequence calculator where x_n+1 = f (x_n).
An example of my code is below. I'm not sure what is wrong with it. I have f(x)=(x+2)^2 rn. I'm writing it to help me with my real analysis class later on.
thanks in advance!
#include <iostream>
using namespace std;
//whitespace package
#include <iomanip>
using std::setw;
int main ()
// n is an array of 100 integers
double n[ 100 ];
// 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++ )
n[ i + 1 ] = ((n[ i ]) + 2)^2; // set element at location i+1 to f(x)= (x+2)^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;
c++
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$
I am super out of practice with writing programs and even the stuff I kindof remember is wholly out-dated. 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. like a sequence calculator where x_n+1 = f (x_n).
An example of my code is below. I'm not sure what is wrong with it. I have f(x)=(x+2)^2 rn. I'm writing it to help me with my real analysis class later on.
thanks in advance!
#include <iostream>
using namespace std;
//whitespace package
#include <iomanip>
using std::setw;
int main ()
// n is an array of 100 integers
double n[ 100 ];
// 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++ )
n[ i + 1 ] = ((n[ i ]) + 2)^2; // set element at location i+1 to f(x)= (x+2)^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;
c++
c++
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.
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.
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 11 mins ago
nessness
1
1
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.
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.
ness is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
);
);
, "mathjax-editing");
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "196"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
ness is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216078%2fc-sequence-calculator-x-n1-f-x-n%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
ness is a new contributor. Be nice, and check out our Code of Conduct.
ness is a new contributor. Be nice, and check out our Code of Conduct.
ness is a new contributor. Be nice, and check out our Code of Conduct.
ness is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216078%2fc-sequence-calculator-x-n1-f-x-n%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown