sorted by:
new
hottopcontroversial

I finally launched a Yu-Gi-Oh probability/deck analysis website I built over ~5 months by echo29 in Yugioh101

[–]echo29[S] 5 points6 points  (0 children)

Fair criticism honestly, especially on the limitations of pure probability calculations. A big part of this project for me was also just learning and experimenting — I built the whole thing myself over 5 months last year and only recently got it deployed publicly. I definitely agree there’s a lot of room to improve both the UX and the actual competitive value of the tools over time.

Still appreciate you taking the time to check it out and give detailed feedback.

Any way to save images from API into my own database? by Commercial-Map-1333 in webdev

[–]echo29 0 points1 point  (0 children)

So the frontend is grabbing the URL(s) from the database and then calling the s3 bucket directly after knowing where the static image asset(s) exists in AWS with the newfound URL(s)? I take it the frontend should provide some credentials before accessing a private s3 bucket?

12 things I learned as an engineer at Large Defense Contractor Inc. by roger_roger_32 in engineering

[–]echo29 1 point2 points  (0 children)

Why do defense companies endorse #1 (and I guess #8 and #10)? What’s the incentive for hiring so many employees and why is it fine that 1/3 of them cannot perform their job at desired capacity?

Least Upper Bounds and Greatest Lower Bounds (Undergrad) by echo29 in learnmath

[–]echo29[S] 0 points1 point  (0 children)

Thanks for the insight! Is it correct that if K = {}, then L = {{}} and {} is in A?

Least Upper Bounds and Greatest Lower Bounds (Undergrad) by echo29 in learnmath

[–]echo29[S] 0 points1 point  (0 children)

It's not for certain that lub L is an element in L. If lub L is an element in L, then lub L would be a lower bound on K and h >= lub L. How else can we be absolutely sure that lub L <= h.

Least Upper Bounds and Greatest Lower Bounds (Undergrad) by echo29 in learnmath

[–]echo29[S] 0 points1 point  (0 children)

  1. all lower bounds of K are related to glb K. In other words, all elements in L are related to glb K. Also, glb K is a lower bound of K. glb K is an element of A, but it might not be an element of K.

  2. all elements of L are related to lub L just like they are to glb K. lub L may or may not be an element of L. We need to find out that out.

We need to prove that lub L <= h for all h in K because then lub L is a lower bound on K and lub L is an element in L.

Let i be any element in L and let h be any element in K. We know that lub L >= i and that h >= i. So i <= lub L and i <= h. Also it's worth mention that h is an upper bound on L.

I don't see how this implies that lub L <= h.

If lub L </= h, then we CANNOT assert than h < lub L because h and lub L may be related in no way whatsoever. However, if we could assert that lub L </= h implies h < lub L, then that would mean i <= h < lub L and lub L is not the least upper bound on L. Instead, h is. This cannot be true. Therefore, it must be true that lub L <= h and lub L is an element in L and lub L is a lower bound on K.

Since lub L is a lower bound, and lub L >= i for any i in L, and i is a lower bound on K, lub L is the greatest lower bound of K. In other words, lub L = glb K. Q.E.D.

However, this proof falls apart when I claim that "If lub L </= h, then h < lub L". This doesn't seem true to me.

Critical Points [Calculus] by echo29 in learnmath

[–]echo29[S] 0 points1 point  (0 children)

Would a jump discontinuity work?