--%>
Assignment Help - homework help

Explain Factorisation by Fermats method

Factorisation by Fermat's method: This method, dating from 1643, depends on a simple and standard algebraic identity. Fermat's observation is that if we wish to nd two factors of n, it is enough if we can express n as the di fference of two squares. This is because if n = a2 - b2, then we have immediately

n = a2 - b2 = (a+b)(a - b);

and so we have found two factors, a+b and a - b, of n.

It is possible here that a - b might equal 1, in which case we will only have found the trivial factorisation n = n x 1, but we can arrange matters so that this will only happen if n has no other factorisation - i.e., is prime.

At first glance, it may seem over-optimistic to hope that an expression for n as the di fference of two squares will exist.

But assume that n is odd, which we can always do if we are trying to factorise n. Then if n = uv and we put

a = 1/2(u+v) and b = 1/2(u - v);

we have n = a2 - b2 (note that a and b are both integers if n is odd), so that a representation of n as the difference of two squares does exist. (In fact, it is easy to see that the above formulae define a one-to-one correspondence between representations of n as the di erence of two squares and as the product of two factors - exercise.)

   Related Questions in Mathematics

  • Q : Elementary Logic Set & Model of a

    Prove that Elementary Logic Set is a Model of a Boolean Algebra The three Boolean operations of Logic are the three logical operations of  OR ( V ), AN

    		•
  • Q : Explain lognormal stochastic

    Explain lognormal stochastic differential equation for evolution of an asset.

    		•
  • Q : Law of iterated expectations for

     Prove the law of iterated expectations for continuous random variables. 2. Prove that the bounds in Chebyshev's theorem cannot be improved upon. I.e., provide a distribution that satisfies the bounds exactly for k ≥1, show that it satisfies the bounds exactly, and draw its PDF. T

    		•
  • Q : Abstract Boolean Algebra I. Boolean

    I. Boolean Algebra Define an abstract Boolean Algebra, B,  as follows:  The three operations are:  +   ( x + y addition) ( x y multiplic

    		•
  • Q : Problem on Linear equations Anny, Betti

    Anny, Betti and Karol went to their local produce store to bpought some fruit. Anny bought 1 pound of apples and 2 pounds of bananas and paid $2.11.  Betti bought 2 pounds of apples and 1 pound of grapes and paid $4.06.  Karol bought 1 pound of bananas and 2

    		•
  • Q : Use MS Excel to do the computations

    Select a dataset of your interest (preferably related to your company/job), containing one variable and atleast 100 data points. [Example: Annual profit figures of 100 companies for the last financial year]. Once you select the data, you should compute 4-5 summary sta

    		•
  • Q : Maths assignment complete assignment

    complete assignment with clear solution and explanation

    		•
  • Q : First-order formulas over the

    Consider the unary relational symbols P and L, and the binary relational symbol On, where P(a) and I(a) encode that a is apoint and a (sraight) line in the 2-dimensional space, respectively, while On(a,b) encodes  that a is a point, b is a line, and o lies on b.

    		•
  • Q : Problem on Fermats method A public key

    A public key for RSA is published as n = 17947 and a = 3. (i) Use Fermat’s method to factor n. (ii) Check that this defines a valid system and find the private key X.

    Q : Properties of a group How can we say

    How can we say that the pair (G, o) is a group. Explain the properties which proof it.

    		•