Search Results for ""
2191 - 2200 of 4154 for Divide whole numbers and integersSearch Results
The conjecture that all integers >1 occur as a value of the totient valence function (i.e., all integers >1 occur as multiplicities). The conjecture was proved by Ford ...
A T_1-space is a topological space fulfilling the T1-separation axiom: For any two points x,y in X there exists two open sets U and V such that x in U and y not in U, and y ...
A unique factorization domain, called UFD for short, is any integral domain in which every nonzero noninvertible element has a unique factorization, i.e., an essentially ...
An Argand diagram is a plot of complex numbers as points z=x+iy in the complex plane using the x-axis as the real axis and y-axis as the imaginary axis. In the plot above, ...
The pentanacci numbers are a generalization of the Fibonacci numbers defined by P_0=0, P_1=1, P_2=1, P_3=2, P_4=4, and the recurrence relation ...
The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...
A pair of numbers m and n such that sigma(m)=sigma(n)=m+n-1, where sigma(m) is the divisor function. Beck and Najar (1977) found 11 augmented amicable pairs.
The two recursive sequences U_n = mU_(n-1)+U_(n-2) (1) V_n = mV_(n-1)+V_(n-2) (2) with U_0=0, U_1=1 and V_0=2, V_1=m, can be solved for the individual U_n and V_n. They are ...
For every k>1, there exist only finite many pairs of powers (p,p^') with p and p^' natural numbers and k=p^'-p.
Quasirandom numbers are numbers selected from a quasirandom sequence. Such numbers are useful in computational problems such as quasi-Monte Carlo integration.
...
View search results from all Wolfram sites (72000 matches)

