How to find i-th root of n whose remainder is the smallest?

  • (2 Pages)
  • +
  • 1
  • 2

15 Replies - 1757 Views - Last Post: 30 June 2019 - 09:43 PM

#16 macosxnerd101   User is offline

  • Games, Graphs, and Auctions
  • member icon




Reputation: 12657
  • View blog
  • Posts: 45,831
  • Joined: 27-December 08

Re: How to find i-th root of n whose remainder is the smallest?

Posted 30 June 2019 - 09:43 PM

Quote

Pi supposedly contains in its digits all possible numbers (there is debate about this, but consider it's true). We can just specify the position and it's compressed!


In general, this will not use fewer than log(n) bits. Even if your claim is true, pi is irrational. Good luck finding an efficient procedure to compute this position a priori.

Not to be rude, but at this point you are throwing around terms for the sake of throwing around terms. It comes across that you don't know what you are talking about. It's fine if you don't know things (we are all here to learn), but throwing around buzzwords you don't really understand and ideas you haven't thought through isn't helpful for anyone. In particular, I would advise you not to fixate on ideas, especially after multiple knowledgeable folks are suggesting these are dead ends. Just to be clear, I am suggesting that your approaches are dead ends and not worth pursuing.

This post has been edited by macosxnerd101: 30 June 2019 - 09:50 PM

Was This Post Helpful? 0
  • +
  • -

  • (2 Pages)
  • +
  • 1
  • 2