Search Results for ""

A theorem, also known as Bachet's conjecture, which Bachet inferred from a lack of a necessary condition being stated by Diophantus. It states that every positive integer can ...

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 cubefree part is that part of a positive integer left after all cubic factors are divided out. For example, the cubefree part of 24=2^3·3 is 3. For n=1, 2, ..., the first ...

The numbers 2^npq and 2^nr are an amicable pair if the three integers p = 2^m(2^(n-m)+1)-1 (1) q = 2^n(2^(n-m)+1)-1 (2) r = 2^(n+m)(2^(n-m)+1)^2-1 (3) are all prime numbers ...

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. ...

Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...

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.