| Display title | Pythagorean triples/Java/Brute force primitives |
| Default sort key | Pythagorean triples/Java/Brute force primitives |
| Page length (in bytes) | 6,544 |
| Namespace ID | 0 |
| Page ID | 7433 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | rosettacode>Mwn3d |
| Date of page creation | 22:31, 14 July 2011 |
| Latest editor | Katsumi a.k.a. Upperdecker2562 (talk | contribs) |
| Date of latest edit | 05:38, 3 December 2024 |
| Total number of edits | 18 |
| Recent number of edits (within past 180 days) | 1 |
| Recent number of distinct authors | 1 |
| Transcluded template (1) | Template used on this page:
|
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | This version brute forces primitive triple candidates and then scales them to find the rest (under the perimeter limit of course). Since it only finds the primitives... |
