# Ho scoperto prime\_division

**URL:** <https://www.ruby-forum.com/t/ho-scoperto-prime-division/168659>\
**Category:** IT\
**Created:** [May 23, 2009, 5:31pm UTC](https://www.ruby-forum.com/t/ho-scoperto-prime-division/168659 "2009-05-23T17:31:53Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![giampiz](https://www.ruby-forum.com/letter_avatar_proxy/v4/letter/g/c67d28/32.png) [@giampiz](https://www.ruby-forum.com/u/giampiz)\
**Post date:** [May 23, 2009, 5:31pm UTC](https://www.ruby-forum.com/t/ho-scoperto-prime-division/168659/1 "2009-05-23T17:31:53Z")

</div>

se siete ciuchini come me forse ancora non lo conoscete:

require “mathn”  
n = 2 **9 \* 3** 2 \* 5\*\*3  
p “Scomposizione in fattori primi di #{n}: #{n.prime\_division.inspect}”

e pensare che mi ero fatto delle funzioni o metodi da solo!  
così è più veloce e comodo da usare

---

<div class="post-metadata">

**Author:** ![giampiz](https://www.ruby-forum.com/letter_avatar_proxy/v4/letter/g/c67d28/32.png) [@giampiz](https://www.ruby-forum.com/u/giampiz)\
**Post date:** [May 24, 2009, 11:09am UTC](https://www.ruby-forum.com/t/ho-scoperto-prime-division/168659/2 "2009-05-24T11:09:14Z")

</div>

Spettacolo !  
Ma… che algoritmo usa sotto ? Adesso indago 😃

Sandro

2009/5/23 Giampiero Z. [removed\_email\_address@domain.invalid](mailto:removed_email_address@domain.invalid)