<p>In this paper, we prove that there exist infinitely many square-free pairs of the form <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(n^2+n+1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>n</mi> <mn>2</mn> </msup> <mo>+</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(n^2+n+2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>n</mi> <mn>2</mn> </msup> <mo>+</mo> <mi>n</mi> <mo>+</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>. We also establish an asymptotic formula for the number of such square-free pairs when <i>n</i> does not exceed given sufficiently large positive number. A key point in our proof is the application of bijective correspondence between the number of representations of number by binary quadratic form and the incongruent solutions of quadratic congruence.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Square-free pairs \(\mathbf {n^2+n+1}\), \(\mathbf {n^2+n+2}\)

  • S. I. Dimitrov

摘要

In this paper, we prove that there exist infinitely many square-free pairs of the form \(n^2+n+1\) n 2 + n + 1 , \(n^2+n+2\) n 2 + n + 2 . We also establish an asymptotic formula for the number of such square-free pairs when n does not exceed given sufficiently large positive number. A key point in our proof is the application of bijective correspondence between the number of representations of number by binary quadratic form and the incongruent solutions of quadratic congruence.