Andrew Tomazos
Reputation
826
Next privilege 1,000 Rep.
Create new tags
 Aug 17 comment Maximization of a sum subject to constraints on 3 resources As the xs are constant you can generalize it to that, but is there a way to take advantage of the fact that the xs repeat in all six permutations to give a simpler solution? Aug 17 asked Maximization of a sum subject to constraints on 3 resources Aug 14 asked Properties of “Digit Sum Root”? Aug 11 comment Efficiently evaluating the Motzkin numbers @Chan: If it was a prime base, then you can use the modular inverse. If it isn't a prime base, than you can use arbitrary precision arithmetic. Aug 9 revised Prime Identification easier than Prime Factorization? added 410 characters in body Aug 9 comment Prime Identification easier than Prime Factorization? I need 100% accuracy on the integers between 1 and 10^20. If there is a single false positive or negative in this range it is useless for my purposes. Aug 8 comment Prime Identification easier than Prime Factorization? I need 100% accuracy and only the running time of the worst case input N matters (ie argmax 2 < i < 10^20 of running time of isPrime(i)). Aug 8 revised Prime Identification easier than Prime Factorization? added 392 characters in body Aug 8 asked Prime Identification easier than Prime Factorization? Aug 7 accepted Modulus Distributing Over Multiplication? Aug 7 comment Modulus Distributing Over Multiplication? I tried to prove the answer and added it to the bottom of my question. Aug 7 revised Modulus Distributing Over Multiplication? added 512 characters in body Aug 3 comment Modulus Distributing Over Multiplication? So the answer is always. So whats the big deal about having a prime base then? Its just having a modular inverse for everything? Aug 3 revised Modulus Distributing Over Multiplication? added 18 characters in body Aug 3 asked Modulus Distributing Over Multiplication? Aug 3 comment Count Exclusive Partitionings of Points in Circle, Closing Double Recurrence? Do you ever get the feeling that its all been done before. These are the Catalan numbers. en.wikipedia.org/wiki/Catalan_number, and the problem I describe is the Noncrossing Partition en.wikipedia.org/wiki/Noncrossing_partition Aug 2 answered Are the two statements concening number theory correct? Aug 2 asked Count Exclusive Partitionings of Points in Circle, Closing Double Recurrence? Aug 2 accepted How many elements $a \in \Bbb{Z}_N$ such that $ax \equiv y \mod N$ Aug 2 comment Efficiently evaluating the Motzkin numbers @AsafKaragila: sorry typo
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6102409362792969, "perplexity": 1683.2313019087953}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-40/segments/1443736672328.14/warc/CC-MAIN-20151001215752-00239-ip-10-137-6-227.ec2.internal.warc.gz"}