uk.co.reliness/maths-statistics · v1.5.0 · productivity
UK Data: Maths and statistics is healthy: it completed an MCP handshake in 1408 ms and exposes 22 tools.
Averages, spread, chi-square, regression, primes, factorials, probability, areas and distances
Endpoint: https://ukdata.reliness.co.uk/mcp/maths-statistics (streamable-http)
No repository listed · Website · JSON · Add to my inventory
| Users (last 30 days) | 0 |
| Handshake | Healthy |
| Auth needed | None |
| Tool count | 22 |
| Latency | 1408 ms |
| Last checked (UTC) | 2026-11-07T15:45:20.423Z |
| Checked (UTC) | Status | Latency | Error |
|---|---|---|---|
| 2026-11-07T15:45:20.423Z | Healthy | 1408 |
is_power_of_two | Checks if a number is a power of two (2^n for some non-negative integer n). (cost: 1 credit) |
dice_roll_probability | Calculates the probability of rolling a specific sum with a given number of dice, each with a specified number of faces. (cost: 1 credit) |
polygon_area_shoelace | Calculates the area of a polygon given its vertices using the shoelace formula (also known as the surveyor's formula). (cost: 1 credit) |
cosine_similarity | Calculates the cosine similarity between two vectors, returning a value between -1 and 1 where 1 indicates identical direction. (cost: 1 credit) |
greatest_common_divisor | Computes the greatest common divisor (GCD) of two non-negative integers using the Euclidean algorithm. (cost: 1 credit) |
linear_regression_prediction | Predicts the y-value for a given x-value using simple linear regression (least squares method) fitted to the provided data points. (cost: 1 credit) |
least_common_multiple | Computes the least common multiple (LCM) of two positive integers using the relationship LCM(a,b) = (a × b) / GCD(a,b). (cost: 1 credit) |
calculate_median | Calculates the median (middle value) of a list of numbers. For even-length lists, returns the average of the two middle values. (cost: 1 credit) |
euclidean_distance | Computes the Euclidean distance between two points in a 2D plane using the formula: sqrt((x2-x1)² + (y2-y1)²). (cost: 1 credit) |
fibonacci | Generates the first n numbers in the Fibonacci sequence, where each number is the sum of the two preceding ones, starting with 0 and 1. (cost: 1 credit) |
chi_square_independence_test | Performs a Chi-Square test for independence on a 2x2 contingency table. Returns the chi-square statistic, p-value, and whether to reject the null hypothesis at the given significance level. (cost: 1 credit) |
create_histogram | Creates a histogram by counting the frequency of data points falling into specified bins or ranges. Returns the frequency count for each bin. (cost: 1 credit) |
calculate_clock_angle | Calculates the smaller angle in degrees between the hour and minute hands of an analog clock given the time. Returns angle between 0 and 180 degrees. (cost: 1 credit) |
factorial | Calculates the factorial of a non-negative integer n, which is the product of all positive integers less than or equal to n. Returns n! = n × (n-1) × ... × 1. (cost: 1 credit) |
calculate_distance | Calculates the great-circle distance between two geographic points using the Haversine formula. Returns distance in kilometers, miles, or nautical miles. (cost: 1 credit) |
calculate_area | Calculates the area of geometric shapes including circle (πr²), triangle (½×base×height), rectangle (length×width), and square (side²). Returns area in square units. (cost: 1 credit) |
calculate_standard_deviation | Calculates the population standard deviation of a list of numbers using the standard formula: sqrt(Σ(x - μ)² / N). (cost: 1 credit) |
average | Calculates the arithmetic mean (average) of a list of numbers by summing all values and dividing by the count. (cost: 1 credit) |
is_prime | Checks if a positive integer is a prime number (only divisible by 1 and itself). Returns false for numbers less than 2. (cost: 1 credit) |
solve_quadratic | Computes the real and complex roots of a quadratic equation ax² + bx + c = 0 using the quadratic formula. Returns both roots or indicates if no real solutions exist. (cost: 1 credit) |
permutation_count | Calculates the number of permutations P(n,k) = n!/(n-k)! representing ordered arrangements of k elements selected from n elements. Returns the count as an integer. (cost: 1 credit) |
probability_consecutive_rolls | Calculates the probability of rolling a specific value consecutively for a given number of rolls on a die with specified sides using the formula (1/num_sides)^num_rolls. Returns probability as a decimal between 0 and 1. (cost: 1 credit) |