0 like 0 dislike
0 like 0 dislike
Generalizing the "remainder" for integer log and sqrt

3 Answers

0 like 0 dislike
0 like 0 dislike
Euclid algorithm recurses over the integer division to get the gcd of two integers.

Similarly, recursing other one of those operations might get interesting results.

E.g., applying the binary log to a number, then to the residue, etc., gives the binary representation of the number (it outputs the 1s).

Finding the continued fraction for a given real number may also fit into your idea - I have not checked.
0 like 0 dislike
0 like 0 dislike
Really what you are computing is:

r = b^(log(b,n)^(+1)) mod n

Discrete logarithm is maybe what you are looking for.
by
0 like 0 dislike
0 like 0 dislike
If you modify your definition of ilog to be ilog_b (n) = {k, r} → n = r•b^k where b ∤ r, then k is the b-adic order of n.

Related questions

0 like 0 dislike
0 like 0 dislike
2 answers
a_dalgleish asked Jun 21
Contributing to the right math area, If all areas are equally curious
a_dalgleish asked Jun 21
0 like 0 dislike
0 like 0 dislike
2 answers
ConradDubai asked Jun 21
How to “topologize” the fundamental group: a primer
ConradDubai asked Jun 21
0 like 0 dislike
0 like 0 dislike
3 answers
MattWoosie asked Jun 21
If you had to pick the best method for solving Poisson’s Equation, which would it be and why?
MattWoosie asked Jun 21
0 like 0 dislike
0 like 0 dislike
8 answers
UnShowNoTanLate asked Jun 21
Is there research on graphs where the edges can connect more than two nodes?
UnShowNoTanLate asked Jun 21
0 like 0 dislike
0 like 0 dislike
15 answers
marcuscallender asked Jun 21
Fixing the "I Must Prove This, Myself!" mindset
marcuscallender asked Jun 21

24.8k questions

103k answers

0 comments

33.7k users

OhhAskMe is a math solving hub where high school and university students ask and answer loads of math questions, discuss the latest in math, and share their knowledge. It’s 100% free!