{
  "annotation_id": "f45d0336-4019-4469-8d44-ddfa02e7eece",
  "date_created": "2026-03-02T18:02:27.671000Z",
  "date_modified": "2026-03-02T18:02:27.671000Z",
  "file_hash": "154ee8e775d043227bef828b64ce818682f2af1842e49b0593842b1e2d472a1f",
  "private": false,
  "record": {
    "abstract": "In this paper, we intend to present a new algorithm to factorize large\nnumbers. According to the algorithm proposed here, we prove that there is a\ncommon factor between p and q. With this procedure, the time of factorization\nconsiderably decreases. The algorithm is based on a graphic representation and,\nwhen the corresponding graph is drawn, coordinate pairs will originate two\nstraight lines that intercept one another. These coordinate pairs are formed by\nprime numbers in the x-axis, and factors in the y-axis, including the factor in\ncommon.",
    "arxiv_id": "quant-ph/0603180",
    "authors": [
      "Fabiano Sutter de Oliveira"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Factorization of large numbers and the suggestion of an algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0603180"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "08eda82a-ce8f-4554-85eb-ba6ff727334d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}