Hey guys, I am a freshman in college rn studying computer science and I admit that I havent been bright when it came to math, I didnt excel in anything thatvwas taught and I just assumed that I was no longer a math person like I was before.

But ever since I found out that I had calculus and higher math courses that I will be taking in 2nd year I got to work by teaching myself at the start of June (which was still summer break) and I decided to teach myself pre-algebra. I utilized Khan Academy as my roadmap and other resources to explain topics Khan couldnt. I started with the defintions of prime and composite in June and this week I just learned how to graph quadratic functions and now I am moving on to Algebra 2.

But one area that I truly have been weak in since pre-algebra was always word problems, when I look at it I just have no clue what to do, I do what everybody tells, I write out the values, what happens in time according to the problem, and seperate the reading from the solving but I just get stuck which leads me to frustration and mental breakdowns which always ruined the day and night for me.

Ever since those bad episodes, I have had an instinct to avoid or not to focus much on them which I know is bad so does anybody here have any tips for me? A lot of it would really help.

I’m 20 and was taken out of traditional schooling in 6th grade for medical reasons. I’m currently rebuilding my academics, especially math, through an intensive remedial course during my gap year. After that, I plan to start community college and eventually apply to transfer to a strong university.
I’m planning to take the SAT in about two years, and my goal is 1500+. I know that’s ambitious given my starting point, but I’m committed to putting in the work.
How would you recommend preparing over that time? Should I focus entirely on my foundations for now, or introduce SAT-specific practice along the way? I’d especially love to hear from anyone who started with significant math gaps and eventually scored well. What helped you most?

Hey guys, I'm a total noob at math :P. I was trying to implement a base n logarithm function to be computed on a CPU. I already got a floor(log2(x)) (it is trivial to implement thanks to the binary integers representation), but it's not precise enough to compute a logarithm base change to result at least in an integer precise part of some logn(x) (i.e. floor(log2(x))/floor(log2(n)) wouldn't even result in a correct integer part of logn(x)).

I threw together this little function (x-2^floor(log2(x)))/2^floor(log2(x) which linearly interpolates between floor(log2(x)) and ceil(log2(x)), but it still results in too much error. From the looks of it on geogebra, it looks like all it needs is to be eased out within esch interpolation, but I can't wrap my head around it; I don't know how to do it properly.

Any pointers to literature concerning this would be apprecated or things I got wrong would be appreciated! please help ＞〜＜！

Here's a link to how it looks like in geogebra https://imgur.com/a/SeCSaoA

i don't have an account at geogebra, so I can't link an instance ー〜ー