The following brilliant.org problem "Prime Cubic Root" is actually the degree 3 bookend prime with narrative which is equivalent to :
https://brilliant.org/problems/prime-cubic-root-2/
The following brilliant.org problem ends with my degree 3 bookend prime with gambling narrative:
https://brilliant.org/problems/attention-all-gamblers-your-cubic-awaits/?ref_id=1268620![]
[G-filtered Polycules](https://www.facebook.com/groups/factorthis/)
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
what if we let the product of primes be represented by the product of prime polynomials ??? Then the expansion of said polynomials may be very interesting toward some insight into primes...
get the latest version of "G-filtered Polycules" here: https://www.facebook.com/groups/factorthis/
this facebook video explains the Game of G-filtered Polycules for Cubics; leave a comment.