ZCubes/Brocards Problem & Brown Numbers

From ZCubes Wiki
Revision as of 07:12, 9 March 2021 by Jayaram (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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


Brocards Problem & Brown Numbers














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.