benchmarks.wiki / Public workspace
Omni-MATH / Let a,b be two integers such that their gcd has at least two prime factors. Let S = x mid x in mathbbN, x equiv a pmod b and call y∈S irreducible if it cannot be expressed … · Discussion
Discussing Let a,b be two integers such that their gcd has at least two prime factors. Let S = { x mid x in mathbb{N}, x equiv a pmod b } and call y∈S irreducible if it cannot be expressed … · Omni-MATH
Posts
Chronological order within this page.
State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.