I am not understanding any algorithm.

In the beginning, people in the forum used up so to write:

Now, I see that people are reluctant to help. I assume that people are getting irritated due to repeated demands.

I think that it is better for me to behave in a way that I think is good, let whatever happen, I am not going to care.

Take the continued fraction expansion of

In my method, to calculate the value of q

_{i}'s that I used up so

The i

^{th} convergents are given up so by

The even convergents are in deficit, and

the odd convergents are in excess.

So, thus, to calculate the values of q

_{i}'s in my trial program, I used up so

If i is even, q

_{i} is the least value such that

If i is odd, q

_{i} is the least value such that

This is the algorithm that I used up so for my trial program.

If it is admissible to use floating point arithmetic, q

_{i} can be directly calculated as follows:

and so on...

But, in the paper by Morrison and Brillhart,

A method of factoring and the factorization of F_{7}
It is rather given some new formulas, where

,

**I don't understand how these formulas are arrived at**

g is reduced to an integer, so how the bottom three formulas will produce an indefinite continued fraction expansion? Just for theory, not the implementations at all, by now itself. Of course, for the time being..

How come

What is P

_{n}?

The term Q

_{n} is indeed OK for me, up so thus.

.

How come

and then

thus?