Let x = 1.(adsbygoogle = window.adsbygoogle || []).push({});

Let n = Next Odd Number

Let y = Previous Sum

x^{2}= 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");

}

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# [Remember Your Squares] Something I Found

Loading...

Similar Threads - Remember Squares Something | Date |
---|---|

I Can we construct a Lie algebra from the squares of SU(1,1) | Feb 24, 2018 |

Least Square basic problem | Jan 20, 2018 |

B ##AB = I \implies BA = I##, for square matricies ##A,B## | Jun 9, 2017 |

I Trying to understand least squares estimates | Feb 25, 2017 |

What does it mean to say that something "is a gauge theory"? | Jun 11, 2014 |

**Physics Forums - The Fusion of Science and Community**