Timeline for A Magic Flying Saucer
Current License: CC BY-SA 4.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 18, 2019 at 13:07 | history | edited | Conifers | CC BY-SA 4.0 |
Add final short answer
|
| Sep 1, 2019 at 23:40 | history | bounty ended | Bernardo Recamán Santos | ||
| Aug 30, 2019 at 4:05 | history | edited | Conifers | CC BY-SA 4.0 |
add source link
|
| Aug 30, 2019 at 2:16 | comment | added | Bernardo Recamán Santos | @Conifers No, I don´t know of any straightforward way of finding the minimum. In fact, I was surprised (and shocked!) to see you had lowered the minimum I had in mind (1080). I start from abundant numbers and construct plausible magic graphs using their many divisors. I don´t really know how to go backwards efficiently other then by pondered trial and error. | |
| Aug 30, 2019 at 1:22 | comment | added | Conifers | @BernardoRecamánSantos I just checked your profile found that you are the math teacher! I am curious about if any mathematical property or concept could be applied on such this question to help find the minimum product or fill in the integers quickly? I just think like coloring problem or prime labeling may help, but need someone's comment due to I am not major in math :P | |
| Aug 29, 2019 at 18:02 | vote | accept | Bernardo Recamán Santos | ||
| Aug 29, 2019 at 16:40 | history | edited | Conifers | CC BY-SA 4.0 |
added 2 characters in body
|
| Aug 29, 2019 at 16:14 | history | edited | Conifers | CC BY-SA 4.0 |
added another improved answer again
|
| Aug 28, 2019 at 19:44 | comment | added | Bernardo Recamán Santos | @Conifers No hurry, take your time. | |
| Aug 28, 2019 at 16:40 | comment | added | Conifers | Hmm still working on it :( | |
| Aug 28, 2019 at 3:45 | comment | added | Conifers | @BernardoRecamánSantos Okay I'll try again~ (I need to update answer in home due to I couldn't upload the image on outside working PC, wait me a while :P) | |
| Aug 27, 2019 at 19:29 | comment | added | Bernardo Recamán Santos | @Conifers Not there yet, but very close! | |
| Aug 27, 2019 at 13:18 | history | edited | Conifers | CC BY-SA 4.0 |
added 32 characters in body
|
| Aug 27, 2019 at 13:08 | history | edited | Conifers | CC BY-SA 4.0 |
added another improved answer
|
| Aug 27, 2019 at 8:20 | comment | added | Conifers | @BernardoRecamánSantos I got some idea, wait me for a while :P | |
| Aug 26, 2019 at 16:54 | comment | added | Bernardo Recamán Santos | @Conifers Nearly there! | |
| Aug 26, 2019 at 16:01 | history | edited | Conifers | CC BY-SA 4.0 |
answer improved
|
| Aug 26, 2019 at 15:50 | comment | added | JMP | You could try (4,3,2), which is less than (3,3,3) | |
| Aug 26, 2019 at 15:17 | comment | added | Bernardo Recamán Santos | Not far, and uses precisely the ideas you are trying. | |
| Aug 26, 2019 at 15:13 | comment | added | Conifers | @BernardoRecamánSantos Is the answer closer to the minimum or still far away? :P | |
| Aug 26, 2019 at 15:04 | comment | added | Bernardo Recamán Santos | Nice, but not the minimum known to me. | |
| Aug 26, 2019 at 14:57 | history | answered | Conifers | CC BY-SA 4.0 |