Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

somefunAgba/PowerPatterns

Folders and files

NameName
Last commit message
Last commit date

Latest commit

History

7 Commits

Repository files navigation

PowerPatterns

Somefun's Power Pattern Algorithm DOI

Recursive Patterns: Integer Powers of Real Numbers

A Theory on Number Computing

1. Somefun's Square Method

The square of any positive or negative real number value, n can be decomposed into the expression below:

square(n) = [(n - 1 ) * (3 + (n - 2))] + 1

2. Somefun's Power Patterns

Any real number, n raised to an integer power, r can be decomposed into a recursive pattern or series of integer powers.

A Visualization of the Somefun's Power Pattern Algorithm is implemented using Python.

About

Recursive Patterns: Integer Powers of Real Numbers

Topics

Resources

License

Stars

Watchers

Forks

Packages

Contributors

Languages

AltStyle によって変換されたページ (->オリジナル) /