View source for ZCubes/Brocards Problem & Brown Numbers

==Brocards Problem & Brown Numbers==
<br/>
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==
<br/>
{{#ev:youtube|kDrGFX21ikw|480|left|Brocards Problem & Brown Numbers}}
<br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/>

==Code-Brocards Problem &Brown Numbers==

 a:=(n!)+1==m^2
 a#;
 b=a(1..100,1..100)
 b.io()
 .filter(x=>x[2]==true)

<br/>
*[[Z3 | Z3 home]]
*[[Z^3 Language Documentation]]
*[[Main_Page | About ZCubes ]] 
<br/>
<br/>
&copy; Copyright 1996-2021, ZCubes, Inc.