Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2): Difference between revisions

 

When performing arithmetic operation on two potentially infinite continued fractions it is possible to generate a rational number. eg <math>\sqrt{2}</math> * <math>\sqrt{2}</math> should produce 2. This will require either that I determine that my internal state is approaching infinity, or limiting the number of terms I am willing to input without producing any output.

=={{header|C++}}==

Nigel Galloway, February 12., 2013

*/

public:

NG_8(int a12, int a1, int a2, int a, int b12, int b1, int b2, int b): a12(a12), a1(a1), a2(a2), a(a), b12(b12), b1(b1), b2(b2), b(b){

[3;7] + [0;2]

NG_8 a(0,1,1,0,0,0,0,1);

r2cf n2(22,7);

std::cout << std::endl;

return 0;

{{out}}

<pre>

</pre>

[1:5,2] * [3;7]

NG_8 b(1,0,0,0,0,0,0,1);

r2cf b1(13,11);

std::cout << std::endl;

return 0;

{{out}}

<pre>

</pre>

[1:5,2] - [3;7]

NG_8 c(0,1,-1,0,0,0,0,1);

r2cf c1(13,11);

std::cout << std::endl;

return 0;

{{out}}

<pre>

</pre>

Divide [] by [3;7]

NG_8 d(0,1,0,0,0,0,1,0);

r2cf d1(22*22,7*7);

std::cout << std::endl;

return 0;

{{out}}

<pre>

</pre>

([0;3,2] + [1;5,2]) * ([0;3,2] - [1;5,2])

r2cf a1(2,7);

r2cf a2(13,11);

std::cout << std::endl;

return 0;