Difference between revisions of "ZCubes/Brocards Problem & Brown Numbers"
Jump to navigation
Jump to search
(→Video) |
|||
| Line 14: | Line 14: | ||
b.io() | b.io() | ||
.filter(x=>x[2]==true) | .filter(x=>x[2]==true) | ||
| − | |||
| − | |||
<br/> | <br/> | ||
| − | © Copyright 1996- | + | *[[Z3 | Z3 home]] |
| + | *[[Z^3 Language Documentation]] | ||
| + | *[[Main_Page | About ZCubes ]] | ||
| + | <br/> | ||
| + | <br/> | ||
| + | © Copyright 1996-2021, ZCubes, Inc. | ||
Latest revision as of 07:12, 9 March 2021
Brocards Problem & Brown Numbers
Brocards problem in mathematics is to find all integer values that satisfy the equation n!+1=m^2, where n and m are integers. Pairs of n and m that solve Brocards problem are called Brown numbers. There are only 3 pairs found at this point of time, of uploading this video. Using ZCubes, you can do computations to find any pairs that may exist. This video demonstrates how to do the computation. Enjoy watching! Use ZCubes online and explore it yourself.
Video
Code-Brocards Problem &Brown Numbers
a:=(n!)+1==m^2 a#; b=a(1..100,1..100) b.io() .filter(x=>x[2]==true)
© Copyright 1996-2021, ZCubes, Inc.