{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FF7U5U5HYZGV5GS63Z63OYZ4JM","short_pith_number":"pith:FF7U5U5H","schema_version":"1.0","canonical_sha256":"297f4ed3a7c64d5e9a5ede7db7633c4b0e1f25449a14021a6cd8ad1182fe16fc","source":{"kind":"arxiv","id":"1106.2029","version":1},"attestation_state":"computed","paper":{"title":"Using Lucas Sequences to Generalize a Theorem of Sierpi\\'nski","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Lenny Jones","submitted_at":"2011-06-10T12:11:41Z","abstract_excerpt":"In 1960, Sierpi\\'nski proved that there exist infinitely many odd positive integers $k$ such that $k\\cdot 2^n+1$ is composite for all positive integers $n$. In this paper, we prove some generalizations of Sierpi\\'nski's theorem with $2^n$ replaced by expressions involving certain Lucas sequences $U_n(\\alpha,\\beta)$. In particular, we show the existence of infinitely many Lucas pairs $(\\alpha,\\beta)$, for which there exist infinitely many positive integers $k$, such that $k (U_n(\\alpha,\\beta)+(\\alpha-\\beta)^2)+1$ is composite for all integers $n\\ge 1$. Sierpi\\'nski's theorem is the special case"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1106.2029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-06-10T12:11:41Z","cross_cats_sorted":[],"title_canon_sha256":"d48ba02173a32e5829666ae29dca748d09f9a4813c1d77a0586c0d33504cc435","abstract_canon_sha256":"3c8373593b207fd03a701aaad1e58e8b90e255a308aef02f21806d251ed0294f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:13.831562Z","signature_b64":"H09QGu5RmWD4eOetQdHtJyBrVximIl58408Zg3QML5Xei3SH4kve3Ss43ByFkxwWnA7MflWGBrSPNz/pvjubCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297f4ed3a7c64d5e9a5ede7db7633c4b0e1f25449a14021a6cd8ad1182fe16fc","last_reissued_at":"2026-05-18T04:20:13.831118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:13.831118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Lucas Sequences to Generalize a Theorem of Sierpi\\'nski","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Lenny Jones","submitted_at":"2011-06-10T12:11:41Z","abstract_excerpt":"In 1960, Sierpi\\'nski proved that there exist infinitely many odd positive integers $k$ such that $k\\cdot 2^n+1$ is composite for all positive integers $n$. In this paper, we prove some generalizations of Sierpi\\'nski's theorem with $2^n$ replaced by expressions involving certain Lucas sequences $U_n(\\alpha,\\beta)$. In particular, we show the existence of infinitely many Lucas pairs $(\\alpha,\\beta)$, for which there exist infinitely many positive integers $k$, such that $k (U_n(\\alpha,\\beta)+(\\alpha-\\beta)^2)+1$ is composite for all integers $n\\ge 1$. Sierpi\\'nski's theorem is the special case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2029","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.2029","created_at":"2026-05-18T04:20:13.831188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2029v1","created_at":"2026-05-18T04:20:13.831188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2029","created_at":"2026-05-18T04:20:13.831188+00:00"},{"alias_kind":"pith_short_12","alias_value":"FF7U5U5HYZGV","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FF7U5U5HYZGV5GS6","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FF7U5U5H","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM","json":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM.json","graph_json":"https://pith.science/api/pith-number/FF7U5U5HYZGV5GS63Z63OYZ4JM/graph.json","events_json":"https://pith.science/api/pith-number/FF7U5U5HYZGV5GS63Z63OYZ4JM/events.json","paper":"https://pith.science/paper/FF7U5U5H"},"agent_actions":{"view_html":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM","download_json":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM.json","view_paper":"https://pith.science/paper/FF7U5U5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2029&json=true","fetch_graph":"https://pith.science/api/pith-number/FF7U5U5HYZGV5GS63Z63OYZ4JM/graph.json","fetch_events":"https://pith.science/api/pith-number/FF7U5U5HYZGV5GS63Z63OYZ4JM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/action/storage_attestation","attest_author":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/action/author_attestation","sign_citation":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/action/citation_signature","submit_replication":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/action/replication_record"}},"created_at":"2026-05-18T04:20:13.831188+00:00","updated_at":"2026-05-18T04:20:13.831188+00:00"}