What is the False Position method?
The False Position method (Latin regula falsi, also called the "scissor method") is a bracketing root-finding technique for solving f(x) = 0. Like bisection, it needs a starting interval [a, b] on which the function changes sign, so that f(a)·f(b) ≤ 0 guarantees a root lies between a and b. Instead of always halving the interval, it draws a straight line between the two endpoints and takes the line's x-intercept as the next estimate, which usually converges faster than bisection.
How to use this calculator
Enter your function as f(x) using standard notation: + - * / ^, parentheses, and functions such as sin, cos, tan, exp, log, ln, sqrt, abs, cbrt. Set the lower endpoint a and upper endpoint b so that f(a) and f(b) have opposite signs. Pick the maximum number of iterations and the number of significant digits to display. The result shows the approximate root x, how many iterations were performed, and the residual f(x), which should be very close to zero.
The formula explained
At each step the next estimate is the x-intercept of the secant line through the bracket endpoints:
If f(x_n) has the same sign as f(a_n), then a is replaced by x_n; otherwise b is replaced. This keeps the sign change — and therefore the bracketed root — intact. Iteration stops when |f(x_n)| falls below the tolerance (about 1e-12) or the iteration limit is reached.
Worked example
For f(x) = x - \cos(x) on [-10, 10]: f(-10) ≈ -10.839 (negative) and f(10) ≈ 10.839 (positive), so the interval brackets a root. The method converges to x ≈ 0.7390851332, where f(x) ≈ 0. This value is the well-known fixed point of cosine.
使用注意事項與精準校對原則（6 大核心守則）
📐 1. 嚴格對齊輸入量綱與單位
輸入各項數值時請務必確認量綱（例如小時、天數、金額、百分比），避免單位不匹配引發推算偏差。
🔒 2. 純前端本機毫秒級隱私保障
所有計算邏輯 100% 在您的終端瀏覽器內完成，資料絕不上傳伺服器，嚴格守護商業與個人隱私。
📊 3. 符合公認學術與產業計算模型
演算法嚴格遵循國際通用數學公式與標準計算模型，經多重情境交叉核對，數值嚴密精確。
📋 4. 一鍵複製與免登入 PDF 匯出
支援一鍵複製推算結果字串至剪貼簿，亦可直接點擊列印按鈕輸出純淨 PDF 工作報表。
🔄 5. 多情景敏感度動態對比
建議針對極端值與多組預期情景分別試算，觀察輸出數據的波動區間，輔助做出更穩健的決策。
🛡️ 6. 專業諮詢與日常參考免責聲明
本工具運算結果供日常排程、學業研習與事前參考之用，如涉及重大法規或投資決策請諮詢持證專家。