[racket-users] Task ,drracket problems solution
As Дмитрий points out the largest divisor of a number is the number itself. Maybe you are looking for the second largest factor. Anyway, people in this list won't help anyone do homework problems. If only because we all here believe that instead of helping we would actually preventing from learning. However, I'll give you some food for thought. The HtDP book contains two sections that you may find useful: - Section 9.3 on natural numbers - The chapter about generative recursion (divide and conquer algorithms) -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[racket-users] Task ,drracket problems solution
Hello. For one integer your examples are wrong. Use function gcd, included in racket https://docs.racket-lang.org/reference/generic-numbers.html#%28def._%28%28quote._~23~25kernel%29._gcd%29%29 -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[racket-users] Task ,drracket problems solution
How can I find the largest-divisor on one integer ex : (largest-divisor 256) -> 128 (largest-divisor 6) -> 3 -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.