https://github.com/mcrowson/multiplicative_persistance

Trying to find 12 steps
https://github.com/mcrowson/multiplicative_persistance

Last synced: 21 days ago
JSON representation

Trying to find 12 steps

• Host: GitHub
• URL: https://github.com/mcrowson/multiplicative_persistance
• Owner: mcrowson
• Created: 2019-03-27T20:21:33.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2019-03-29T14:44:22.000Z (almost 6 years ago)
• Last Synced: 2024-10-27T22:58:45.003Z (2 months ago)
• Language: Python
• Size: 83 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Multiplicative Persistence Calculator

I got inspired by [Numberphile](https://www.youtube.com/watch?v=Wim9WJeDTHQ) to try and find 

a number with more than 11 steps. I don't think one exists. As digit lengths get

larger and larger the probability of finding each step excluding a 0 drops. 

Ran this up to 410 digit lenghts without finding more than 11 steps.

![](frequencies.png)