Timeline for Optimization problems over the Integers
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 27, 2014 at 12:36 | vote | accept | Fabio | ||
| Nov 26, 2014 at 18:04 | answer | added | Bob Hanlon | timeline score: 3 | |
| Nov 26, 2014 at 17:54 | answer | added | Dr. belisarius | timeline score: 1 | |
| Nov 26, 2014 at 17:47 | comment | added | Dr. belisarius |
i = IntegerPart; sol = NMaximize[{(3 i@ n + 4)/(2 i@n + 1), n > 1}, n]; i@n /. sol[[2]]
|
|
| Nov 26, 2014 at 17:45 | history | edited | Dr. belisarius | CC BY-SA 3.0 |
edited title; edited tags
|
| Nov 26, 2014 at 17:36 | history | edited | Dr. belisarius | CC BY-SA 3.0 |
added 91 characters in body
|
| Nov 26, 2014 at 17:22 | comment | added | Fabio | I used this expression but couldn't find min and max of this: (3 n + 4)/(2 n + 1). | |
| Nov 26, 2014 at 17:21 | comment | added | Dr. belisarius | Welcome to Mathematica.SE! I suggest the following: 1) As you receive help, try to give it too, by answering questions in your area of expertise. 2) Read the faq! 3) When you see good questions and answers, vote them up by clicking the gray triangles, because the credibility of the system is based on the reputation gained by users sharing their knowledge. Also, please remember to accept the answer, if any, that solves your problem, by clicking the checkmark sign! | |
| Nov 26, 2014 at 17:20 | comment | added | Dr. belisarius |
You can use f[x_Integer]:=... but that won't help you to solve diophantine eqs in the general case. Please show what kind of problems you need to solve
|
|
| Nov 26, 2014 at 17:19 | comment | added | Öskå |
f[x_Integer] := x? f[1] will work while f[1.] won't.
|
|
| Nov 26, 2014 at 17:16 | history | asked | Fabio | CC BY-SA 3.0 |