# Difference between revisions of "Simon's Favorite Factoring Trick"

Raghugoel1 (talk | contribs) m (→Olympiad) |
m (→Olympiad) |
||

Line 29: | Line 29: | ||

Prove that <math>N</math> is a perfect square. (British Mathematical Olympiad Round 2, 2005) | Prove that <math>N</math> is a perfect square. (British Mathematical Olympiad Round 2, 2005) | ||

− | Enjoy the problems | + | Enjoy the problems!!! :) |

== See More== | == See More== |

## Revision as of 16:19, 3 April 2020

## Contents

## The General Statement

The general statement of SFFT is: . Two special common cases are: and .

The act of adding to in order to be able to factor it could be called "completing the rectangle" in analogy to the more familiar "completing the square."

## Applications

This factorization frequently shows up on contest problems, especially those heavy on algebraic manipulation. Usually and are variables and are known constants. Also, it is typically necessary to add the term to both sides to perform the factorization.

## Fun Practice Problems

### Introductory

- Two different prime numbers between and are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?

(Source)

### Intermediate

- are integers such that . Find .

(Source)

### Olympiad

- The integer is positive. There are exactly 2005 ordered pairs of positive integers satisfying:

Prove that is a perfect square. (British Mathematical Olympiad Round 2, 2005)

Enjoy the problems!!! :)