Cramer's paradox: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

6 April 2024

26 February 2024

21 February 2024

20 February 2024

18 February 2024

23 November 2023

12 November 2023

1 September 2023

  • curprev 23:1823:18, 1 September 2023Falw talk contribsm 7,025 bytes +1 In the case of two non-degenerate conics, I corrected the statement involving the bound due to Bézout's theorem being nine. The statement made originally is misleading: Bézout's theorem states that there can be no more than <math>n^2</math> intersection points. But for conics <math>n=2</math> leading to an upper bound of four points, not nine undo

9 July 2023

7 July 2023

12 February 2023

17 July 2022

15 December 2021

7 December 2020

20 November 2020

23 April 2020

17 November 2019

6 October 2018

12 August 2018

1 June 2018

31 May 2018

14 May 2018

3 February 2018

9 November 2017

22 June 2017

30 November 2016

3 September 2015

29 August 2015

22 June 2015

15 May 2015

3 February 2015

26 January 2015

22 October 2014

23 May 2014

22 May 2014

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)