Fast Exponential Implementation in C – based on 2nd degree polynomial
I made a fast approximation of the exponential function (e^x) based on a 2nd-degree polynomial. However, the program doesn’t give reasonable numbers if x<0.0 .
C math problem when adding two numbers together [closed]
Closed 23 mins ago.
implement the Gaussian Hypergeometric Function 2F1(a, b, c, z) in C#, with the ability on handling negative and large z values
How can I implement the Gaussian Hypergeometric Function 2F1(a, b, c, z) in C#, with the ability on handling negative and large z values?
Calculate salary based on Present and Absent days in C# without using inbuilt methods such as Math
Sample data :
Mathematical condition in C
Im a CSE fresher. I found this code on w3school and dont know whats going on.
Fibunacci reursive dynamic structure
I am trying to do assignmet that we had on test from Algorithms and I am struggling to implement fibbunaci for higher n (range of numbers).
Monthly compounding interest with monthly contributions calculation does not return the correct values
My code is supposed to calculate the yearly balance using compounding monthly interest with contributions, but it returns values that are the incorrect amount. As an example, initialInvestment is 1869.57, monthlyDeposit is 14, interestRate is 9.50, and numberOfYears is 19. It’s supposed to return 20193.81, but instead it returns 20264.33. How would I fix it so it returns the correct values?
how d i fix this number of digits counter in C lang code?
#include <stdio.h> int digits (int n); int main () { int c,d; while((c = scanf(“%d”,&d))!=EOF) { printf(“%d n”,digits(d)); } return 0 ; } int digits (int n) { int p ; if (n<10) { p++ ; return p; } else { p++; n/=10; digits (n); } } i expected it to recursively increase p but […]
C# Math.Round() result is unpredictable
I have encountered this issue in my .NET Framework 4.8 project, but it also can be reproduced in .NET 8 (https://learn.microsoft.com/en-us/dotnet/api/system.math.round?view=net-8.0#code-try-2).
in C code : Why workers in challenges are 5 != 5? ((d / x) * y) != (((x * d)/(x + y)) * y)?
I encountered this issue solving a competitive programming challenge [Easy]