# US 2021/0173892 A1 · Factorization of Integers without the use of Division or Knowledge of Integer Prime Values

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0173892 A1
- Document ID: US20210173892A1
- Status: Published application
- Kind: A1
- Application number: 16/706,715
- Filed: 2019-12-07
- Published: 2021-06-10
- Earliest claimed: 2019-12-07
- Inventors: John Thomas Favor
- Web page: https://patentgrep.com/patent/US20210173892A1

## CPC

- G06F 7/02: Comparing digital values (G06F7/06, {G06F7/22,} G06F7/38 take precedence)
- G06F 17/10: Complex mathematical operations {(function generation by table look-up G06F1/03; evaluation of elementary functions by calculation G06F7/544)}
- G06F 7/4912: {Adding; Subtracting (G06F7/492, G06F7/498 take precedence)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

This method uses the operations of addition or subtraction in combination with comparison to determine a factor pair from a given odd integer.

## Claims

### Claim 1

1) The claim of this application is in the use of integer square differences to locate factor pairs and

### Claim 2

2) The use of successive odd integer values as a way of forcing a sum to always land on a value that is an integer square.
