- #1
SomeGuy121
- 8
- 0
Let x = 1.
Let n = Next Odd Number
Let y = Previous Sum
x2 = x
+3 = 4 = (1+x)2
+5 = 9 = (3+x)2
+n = n+y = (n-2 + x)2
You could make a program to list all the squares without invoking the multiplication function or squaring function using a simple loop.
C++ Example:
#include "stdafx.h"
#include <iostream>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
cout<<"Squares: \n\n";
int sum=1,nextOdd=1; // Sum is Starting Integer Squared, Declared X in the For Loop below
for(int x=1;x<100;x++)
{
cout<<x<<" Squared is "<<sum<<"\n";
nextOdd+=2;
sum+=nextOdd;
}
system("pause");
}
Let n = Next Odd Number
Let y = Previous Sum
x2 = x
+3 = 4 = (1+x)2
+5 = 9 = (3+x)2
+n = n+y = (n-2 + x)2
You could make a program to list all the squares without invoking the multiplication function or squaring function using a simple loop.
C++ Example:
#include "stdafx.h"
#include <iostream>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
cout<<"Squares: \n\n";
int sum=1,nextOdd=1; // Sum is Starting Integer Squared, Declared X in the For Loop below
for(int x=1;x<100;x++)
{
cout<<x<<" Squared is "<<sum<<"\n";
nextOdd+=2;
sum+=nextOdd;
}
system("pause");
}