B Is there a way to find the integer representation of a real number?

hatem240600
Messages
7
Reaction score
3
Is there a way to find the integer of a real number? Of course without using the [x] function. What I am looking for here is an algebraic formula.
 
Mathematics news on Phys.org
You want an algorithm for a function without allowing the use of functions, right ?

How about IF statements ? Range of your function ?

(by the way, in many computer languages a = b does tthe trick if a is an integer and b a real :smile: )
 
Last edited by a moderator:
  • Like
Likes jedishrfu
You can get pretty close by starting with arctan(tan(x)). This gives you a sawtooth which you can shift, scale and subtract from f(x)=x. It's just those pesky points where tan x is undefined that get you.

Will you allow arctan2 as part of an algebraic formula?
 
To get answers that you want, you will note that the posters so far have asked how you define algebraic. These answers are reasonable. Please provide a solid definition. We cannot leave the thread open, if you continue to have the people who are helping you forced to guess. Thanks.
 
  • Like
Likes YoungPhysicist, jedishrfu and BvU
Since the OP has come back to the site and ignored the request for question improvement, this thread is closed. Thanks to the two posters who gave it a good try.
 
  • Like
Likes YoungPhysicist, BvU and berkeman
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top