97eb14d

committed
# Commits

# Comments (0)

# Files changed (3)

# Makefile

-all: make-dirs docbook_targets fortunes-target latemp_targets sitemap_targets copy_fortunes site-source-install presentations_targets lc_pres_targets art_slogans_targets

+all: make-dirs docbook_targets fortunes-target latemp_targets sitemap_targets copy_fortunes site-source-install presentations_targets lc_pres_targets art_slogans_targets graham_func_pres_targets

+ (cd slides/ && (for I in *.html ; do tidy -asxhtml -o "$$I".new "$$I" ; mv -f "$$I".new "$$I" ; done)) \

# lib/presentations/spork/Perl/Graham-Function/Spork.slides

+* Check all the possible series that end with n+1, then those that end with n+2 , then those that end with n+3.

+* Thus, when multiplying integers to form a perfect square, what matters is their uneven-exponented factors.

+* Thus, an integer can be represented (as far as we're concerned) as a vector of its squaring factors:

+* When multiplying two squaring vectors, their components cancel each other. So if p existed in both vectors, it won't exist in the product.

+00 Possibly assign it as the controlling vector of the minimal (ID-wise) prime in its stair shape version, and canonize the rest of the base accordingly.

+* Check if between n and n+largest_factor we can fit a square times get_squaring_factors{n*(n+largest_factor)}. If so, return n+largest_factor.