<p>In this article, we derive a necessary condition for a number of the form <i>n = </i><InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(2pq\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mi>p</mi> <mi>q</mi> </mrow> </math></EquationSource> </InlineEquation>, where <i>p</i> and <i>q</i> are distinct prime numbers satisfying <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\((p, q) \equiv (1, 5) \pmod{8}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo stretchy="false">)</mo> <mo>≡</mo> <mo stretchy="false">(</mo> <mn>1</mn> <mo>,</mo> <mn>5</mn> <mo stretchy="false">)</mo> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>8</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, to be a congruent number. Specifically, we obtain congruence relations involving the 2-part of the class number of the imaginary quadratic field <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathbb{Q}(\sqrt{-pq})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">Q</mi> <mo stretchy="false">(</mo> <msqrt> <mrow> <mo>-</mo> <mi>p</mi> <mi>q</mi> </mrow> </msqrt> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, which must hold whenever <i>n</i> is congruent.</p>

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

A necessary condition for \(2pq\) to be a congruent number

  • S. Das

摘要

In this article, we derive a necessary condition for a number of the form n = \(2pq\) 2 p q , where p and q are distinct prime numbers satisfying \((p, q) \equiv (1, 5) \pmod{8}\) ( p , q ) ( 1 , 5 ) ( mod 8 ) , to be a congruent number. Specifically, we obtain congruence relations involving the 2-part of the class number of the imaginary quadratic field \(\mathbb{Q}(\sqrt{-pq})\) Q ( - p q ) , which must hold whenever n is congruent.