Mathematics Asked by Ifn47 on August 3, 2020

I need to obtain prime factorizations of numbers of the type: $sum_{i=0}^n p^i$, for any prime number $p$ (not the same one each time).

Do you know if there is a quicker algorithm to calculate these factorizations than those used for other natural numbers?

I don’t know if there is a known solution. My only lead is that all Mersenne primes are of the form $sum_{i=0}^n 2^i$.

Edit: by prime factorization I mean, for example, if $p$ is 3 and $n$ is 6, the number is 364, and the prime factorization I’m looking for is 2^2, 7 and 13.

You have a geometric series, so $sum_{i=0}^n p^i=frac {p^{n+1}-1}{p-1}$. When the prime is $2$ this does not give a factorization because the denominator is $1$. For all other primes it does.

Correct answer by Ross Millikan on August 3, 2020

Get help from others!

Recent Questions

- How can I transform graph image into a tikzpicture LaTeX code?
- How Do I Get The Ifruit App Off Of Gta 5 / Grand Theft Auto 5
- Iv’e designed a space elevator using a series of lasers. do you know anybody i could submit the designs too that could manufacture the concept and put it to use
- Need help finding a book. Female OP protagonist, magic
- Why is the WWF pending games (“Your turn”) area replaced w/ a column of “Bonus & Reward”gift boxes?

Recent Answers

- Lex on Does Google Analytics track 404 page responses as valid page views?
- haakon.io on Why fry rice before boiling?
- Joshua Engel on Why fry rice before boiling?
- Peter Machado on Why fry rice before boiling?
- Jon Church on Why fry rice before boiling?

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP