请输入您要查询的字词:

 

单词 PolyasConjecture
释义

Pólya’s conjecture


(George Pólya) Given any range of consecutive integers from 1 to n>1, at least half, if not more, of the integers in that range will have an odd numberMathworldPlanetmathPlanetmath of prime factorsMathworldPlanetmath (not necessarily distinct). Or, restated using the Liouville functionDlmfMathworldPlanetmath λ(i)=(-1)Ω(i) (where Ω(i) is the number of (nondistinct) prime factors functionMathworldPlanetmath (http://planetmath.org/NumberOfNondistinctPrimeFactorsFunction)), there is no such n>1 such that L(n)>0 where

L(n)=i=1nλ(i).

The zeroes of the sum of the Liouville function below 1000 (namely 2, 4, 6, 10, 16, 26, 40, 96, 586, listed in A028488 of Sloane’s OEIS) were known early on after the conjecture was posed. These are all followed by primes, with the exception of 26, which is followed by 33.

Arthur Ingham proved the conjecture false in 1942 and gave a method for finding counterexamples, but the first counterexample wasn’t found until 1960 by Robert Lehman, namely n=906180359. Two decades later, Minoru Tanaka found the smallest counterexample at n=906150257; the next three integers have 2, 4 or 6 non-distinct prime factors.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 19:53:31