Php de şu problemi nasıl çözceğimiz konusunda bi bilgisi olan var sa lütfen yardım etsin
Prob:Two numbers are called Amicable (or friendly) if each equals to the sum of the aliquot divisors
of the other. Aliquot divisors mean all the divisors excluding the number itself. For example,
aliquot divisors of number 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110. The aliquot divisors
of number 284 are 1, 2, 4, 71 and 142.
If we represent an amicable pair by (m,n) and sum of aliquot divisors of m and n by σ(m) and
σ
respectively, then for amicable pair (220, 284) we get
σ(m) = σ(220) = 1+2+4+5+10+11+20+22+44+55+110 = 284 = n
σ = σ(284) = 1+2+4+71+142 = 220 = m
It can be seen that each amicable number has the power to generate another. The smallest
amicable pair (220, 284) is known from antiquity. It was not until 1636 that Fermat discovered
another pair of amicable numbers (17296, 18416). Later Descartes gave the third pair of
amicable numbers i.e. (9363584, 9437056). These results were actually rediscoveries of
numbers known to Arab mathematicians. In the 18th century Euler drew up a list of 64 amiable
pairs (two of which later shown to be unfriendly). Paganini, a 16 years Old Italian, startled the
mathematical world in 1866 by announcing that the numbers 1184 and 1210 were friendly. It
was the second lowest pair and had been completely overlooked until then; even Euler’s list of
amicable pairs does not contain it. Today about 11222079 pairs of amicable numbers are
known.
Yani sonuç olarak bize sorduğu arkadaş sayıları php de çöz nasılş yapcağımız konusunda bi bilgsi olan var sa lütfen yardım etsin SAYGILAR
Prob:Two numbers are called Amicable (or friendly) if each equals to the sum of the aliquot divisors
of the other. Aliquot divisors mean all the divisors excluding the number itself. For example,
aliquot divisors of number 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110. The aliquot divisors
of number 284 are 1, 2, 4, 71 and 142.
If we represent an amicable pair by (m,n) and sum of aliquot divisors of m and n by σ(m) and
σ
respectively, then for amicable pair (220, 284) we getσ(m) = σ(220) = 1+2+4+5+10+11+20+22+44+55+110 = 284 = n
σ
= σ(284) = 1+2+4+71+142 = 220 = mIt can be seen that each amicable number has the power to generate another. The smallest
amicable pair (220, 284) is known from antiquity. It was not until 1636 that Fermat discovered
another pair of amicable numbers (17296, 18416). Later Descartes gave the third pair of
amicable numbers i.e. (9363584, 9437056). These results were actually rediscoveries of
numbers known to Arab mathematicians. In the 18th century Euler drew up a list of 64 amiable
pairs (two of which later shown to be unfriendly). Paganini, a 16 years Old Italian, startled the
mathematical world in 1866 by announcing that the numbers 1184 and 1210 were friendly. It
was the second lowest pair and had been completely overlooked until then; even Euler’s list of
amicable pairs does not contain it. Today about 11222079 pairs of amicable numbers are
known.
Yani sonuç olarak bize sorduğu arkadaş sayıları php de çöz nasılş yapcağımız konusunda bi bilgsi olan var sa lütfen yardım etsin SAYGILAR