meta user
network profile
| bio | website | normalesup.org/~lairez |
|---|---|---|
| location | France | |
| age | 25 | |
| visits | member for | 1 year, 4 months |
| seen | 2 days ago | |
| stats | profile views | 255 |
Ph. D. student at INRIA Rocquencourt (France)
|
2d |
awarded | Necromancer |
|
Apr 28 |
comment |
Simplifying $\prod_{k=0}^n \cos(2^{-k})$ Thanks, unfortunately Euler's formula is taught in Terminale S, not Première ;) |
|
Apr 28 |
accepted | Simplifying $\prod_{k=0}^n \cos(2^{-k})$ |
|
Apr 28 |
comment |
Simplifying $\prod_{k=0}^n \cos(2^{-k})$ Clever, thanks ! |
|
Apr 28 |
asked | Simplifying $\prod_{k=0}^n \cos(2^{-k})$ |
|
Mar 3 |
comment |
$x_n \in \mathbb R, \quad x_n \to A \implies \max \{x_n,A-x_n\} \to ?$ Isn't $x\mapsto \max(x,A-x)$ a continuous function ? |
|
Feb 14 |
answered | Irreducibility of Polynomials in $k[x,y]$ |
|
Feb 12 |
comment |
Prove elementarily that $\sqrt[n+1] {(n+1)!} - \sqrt[n] {n!}$ is strictly decreasing I think your question is meaning less: I doubt you can construct (I mean really construct) any totally ordered nth-root-closed field without calculus (topology, analysis or whatever you call things based on Cauchy sequences). |
|
Feb 6 |
awarded | Custodian |
|
Feb 6 |
reviewed | Satisfactory A question on complex numbers |
|
Feb 6 |
reviewed | Needs Improvement Complex analysis (periodic function) |
|
Feb 6 |
reviewed | Satisfactory Empirical distribution vs. the true one: How fast $KL( \hat{P}_n || Q)$ converges to $KL( P || Q)$? |
|
Feb 6 |
reviewed | Needs Improvement Logic about systems? |
|
Feb 6 |
reviewed | Needs Improvement Limit Computation of $(e^x+x)^{1/x}$ as $x$ approaches zero |
|
Feb 6 |
answered | Computer Algebra: Algorithms for solving equations symbolically |
|
Jan 7 |
awarded | Yearling |
|
Nov 7 |
comment |
Prove that there are no natural numbers, $i, j$ such that $ 3i^2+3i+7=j^3$ Of course it does not bother me/us ! I'm just curious. |
|
Nov 7 |
comment |
Prove that there are no natural numbers, $i, j$ such that $ 3i^2+3i+7=j^3$ Why are you interested in this question ? |
|
Nov 6 |
comment |
Number of consecutive zeros at the end of $11^{100} - 1$. Some people around does not like computations... That's a shame. |
|
Nov 6 |
comment |
What would be complexity of computing $3^{n^n}$? @RobertIsrael, As far as I know you are free to choose the representation you prefer. And speaking about computational complexity base 2 is a good and standard choice. For this matter I don't think of my computer to be something else than a classic – but classy ! — Turing machine. |
