Search Results for ""
231 - 240 of 1780 for Prime FactorSearch Results
A transformation characterized by an invariant line and a scale factor (one-way stretch) or two invariant lines and corresponding scale factors (two-way stretch).
Erdős proved that there exist at least one prime of the form 4k+1 and at least one prime of the form 4k+3 between n and 2n for all n>6.
There exist infinitely many n>0 with p_n^2>p_(n-i)p_(n+i) for all i<n, where p_n is the nth prime. Also, there exist infinitely many n>0 such that 2p_n<p_(n-i)+p_(n+i) for ...
Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...
"Analysis of Variance." A statistical test for heterogeneity of means by analysis of group variances. ANOVA is implemented as ANOVA[data] in the Wolfram Language package ...
Lehmer's totient problem asks if there exist any composite numbers n such that phi(n)|(n-1), where phi(n) is the totient function? No such numbers are known. However, any ...
A finite set of contraction maps w_i for i=1, 2, ..., N, each with a contractivity factor s<1, which map a compact metric space onto itself. It is the basis for fractal image ...
An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...
A modification of the Eberhart's conjecture proposed by Wagstaff (1983) which proposes that if q_n is the nth prime such that M_(q_n) is a Mersenne prime, then ...
Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...
...
View search results from all Wolfram sites (10835 matches)

