Quasi-Newton method: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
No edit summary
en>Velvel2
m Further reading: dead link
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
An '''Achilles number''' is a number that is [[Powerful number|powerful]] but not a [[perfect power]].<ref name=mw>{{MathWorld|urlname=AchillesNumber|title=Achilles Number}}
Architectural, Building and Surveying Professionals  Judson from Red Lake, enjoys skeet shooting, ganhando dinheiro na internet and sketching. Gains a lot of encouragement from life by touring spots like Sun Temple.<br><br>my blog :: [http://www.comoganhardinheiro101.com/inicio/ como ficar rico]
</ref> A positive integer ''n'' is a powerful number if, for every [[prime factor]] ''p'' of ''n'', ''p''<sup>2</sup> is also a divisor. In other words, every prime factor appears at least squared in the factorization. All Achilles numbers are powerful. However, not all powerful numbers are Achilles numbers: only those that cannot be represented as ''m<sup>k</sup>'', where ''m'' and ''k'' are positive integers greater than 1.
 
Achilles numbers are named after [[Achilles]], a hero of the [[Trojan war]], who was also powerful but imperfect.
 
==Sequence of Achilles numbers==
A number ''n'' = ''p''<sub>1</sub><sup>''a''<sub>1</sub></sup>''p''<sub>2</sub><sup>''a''<sub>2</sub></sup>…''p''<sub>''k''</sub><sup>''a''<sub>''k''</sub></sup> is [[powerful number|powerful]] if min(''a''<sub>1</sub>, ''a''<sub>2</sub>, …, ''a''<sub>''k''</sub>) ≥&nbsp;2. If in addition gcd(''a''<sub>1</sub>, ''a''<sub>2</sub>, …, ''a''<sub>''k''</sub>) = 1 the number is an Achilles number.
 
The Achilles numbers up to 5000 are:
:72, 108, 200, 288, 392, 432, 500, 648, 675, 800, 864, 968, 972, 1125, 1152, 1323, 1352, 1372, 1568, 1800, 1944, 2000, 2312, 2592, 2700, 2888, 3087, 3200, 3267, 3456, 3528, 3872, 3888, 4000, 4232, 4500, 4563, 4608, 5000 {{OEIS|id=A052486}}.
 
The smallest pair of consecutive Achilles numbers is:<ref>Carlos Rivera, ''The Prime Puzzles and Problem Connection'', [http://www.primepuzzles.net/problems/prob_053.htm Problem 53]</ref>
 
: 5425069447 = 7<sup>3</sup> &times; 41<sup>2</sup> &times; 97<sup>2</sup>
: 5425069448 = 2<sup>3</sup> &times; 26041<sup>2</sup>
 
==Examples==
108 is a powerful number. Its [[prime factorization]] is 2<sup>2</sup>&nbsp;·&nbsp;3<sup>3</sup>, and thus its prime factors are 2 and 3. Both 2<sup>2</sup> = 4 and 3<sup>2</sup> = 9 are divisors of 108. However, 108 cannot be represented as ''m<sup>k</sup>'', where ''m'' and ''k'' are positive integers greater than 1, so 108 is an Achilles number.
 
Finally, 784 is not an Achilles number. It is a powerful number, because not only are 2 and 7 its only prime factors, but also 2<sup>2</sup> = 4 and 7<sup>2</sup> = 49 are divisors of it. Nonetheless, it is a perfect power:
 
:<math>784=2^4 \cdot 7^2 = (2^2)^2 \cdot 7^2 = (2^2 \cdot 7)^2 = 28^2. \, </math>
 
So it is not an Achilles number.
 
== References ==
{{reflist}}
 
 
{{Divisor classes}}
{{Classes of natural numbers}}
 
{{DEFAULTSORT:Achilles Number}}
[[Category:Integer sequences]]

Latest revision as of 06:41, 11 December 2014

Architectural, Building and Surveying Professionals Judson from Red Lake, enjoys skeet shooting, ganhando dinheiro na internet and sketching. Gains a lot of encouragement from life by touring spots like Sun Temple.

my blog :: como ficar rico