Maybe this? c3=. (%3)^~poss=. 4002x */ >:i.999 n=. poss%(<.c3)*>.c3 1 e. poss=n*(<.n)*>.n 1
On Mon, Oct 18, 2021 at 8:02 PM Raul Miller <[email protected]> wrote: > I think that 64 is too big. > 64^3 > 262144 > > I don't think this one has a solution, because 4002%15*16 is too > large, and 4002%16*17 is too small. > > I haven't explored gaussian integers here, but my gut feeling is that > there won't be any viable candidates there, either. > > I hope this helps, > > -- > Raul > > On Mon, Oct 18, 2021 at 7:25 PM Skip Cave <[email protected]> wrote: > > > > How to solve this problem? > > > > 4002x = n * (<.n) * (>.n) > > > > > > What is n, where n is a rational fraction greater than 1, and the answer > is > > a rational fraction? There are likely many answers, so find some answers > > near 64. The result in J should be a 1: > > > > 4002x = n * (<.n) * (>.n) > > 1 > > > > > > Skip > > > > Skip Cave > > Cave Consulting LLC > > ---------------------------------------------------------------------- > > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > -- Devon McCormick, CFA Quantitative Consultant ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
