Arithmetic Game for Beginners [on hold] The Next CEO of Stack OverflowHow to prove an arithmetic convolution identity?Exponential Diophantine Equations for BeginnersFind the last member remained in gameCalculating unique “damage-per-second” for a gameArithmetic SeriesInterval arithmetic for open intervalsChopping arithmeticBasic arithmeticIs there a general algorithm for these “simple” arithmetic problems?!Puzzle involving arithmetic series - will this game always end

Contours of a clandestine nature

Example of a Mathematician/Physicist whose Other Publications during their PhD eclipsed their PhD Thesis

Is it possible to search for a directory/file combination?

Unreliable Magic - Is it worth it?

How do scammers retract money, while you can’t?

Can I equip Skullclamp on a creature I am sacrificing?

Elegant way to replace substring in a regex with optional groups in Python?

How did the Bene Gesserit know how to make a Kwisatz Haderach?

Can you replace a racial trait cantrip when leveling up?

How to avoid supervisors with prejudiced views?

Bold, vivid family

Make solar eclipses exceedingly rare, but still have new moons

How to safely derail a train during transit?

How to invert MapIndexed on a ragged structure? How to construct a tree from rules?

Would a galaxy be visible from outside, but nearby?

Why does the UK parliament need a vote on the political declaration?

Why has the US not been more assertive in confronting Russia in recent years?

Are there any unintended negative consequences to allowing PCs to gain multiple levels at once in a short milestone-XP game?

Would a completely good Muggle be able to use a wand?

If Nick Fury and Coulson already knew about aliens (Kree and Skrull) why did they wait until Thor's appearance to start making weapons?

Would this house-rule that treats advantage as a +1 to the roll instead (and disadvantage as -1) and allows them to stack be balanced?

In excess I'm lethal

How did people program for Consoles with multiple CPUs?

Is there an analogue of projective spaces for proper schemes?



Arithmetic Game for Beginners [on hold]



The Next CEO of Stack OverflowHow to prove an arithmetic convolution identity?Exponential Diophantine Equations for BeginnersFind the last member remained in gameCalculating unique “damage-per-second” for a gameArithmetic SeriesInterval arithmetic for open intervalsChopping arithmeticBasic arithmeticIs there a general algorithm for these “simple” arithmetic problems?!Puzzle involving arithmetic series - will this game always end










0












$begingroup$


I came up with this game yesterday, intended for first year college students in a very elementary math course, here it goes:



Suppose we have the numbers 1 2=3. If we place the $+$ sign between 1 and 2 we get 1+2=3, which is correct. Suppose now we have 1 2 3=4, I can make -1+2+3=4, which is also correct. I can also make, for 5, 6 and 7



$-1cdot2+3+4=5$



$1-2+3cdot4-5=6$



$1+2-3-4+5+6=7$



So the challenge is, to reach the most natural numbers from $$1quad2quad3quad4quadldotsquad (n-1)=n$$ by using addition subtraction, product and division in between the numbers without rearranging them.



At first this game seemed interesting, and eventually begin to wonder if this was always possible, and for instance, noticed (though not formally proved) that for the numbers $n=3+4k$ it is always possible. Feel free to post any interesting property you find.



Thanks










share|cite|improve this question









$endgroup$



put on hold as too broad by hardmath, Cesareo, Shailesh, Parcly Taxel, dantopa 2 days ago


Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.













  • 3




    $begingroup$
    "Feel free to post any interesting property you find" is not a question. If you review How to Ask, you'll see that Math.SE seeks Q&A content that is less chatty and more definitive than many forums collect. For example you might ask what the smallest $ngt 3$ is for which the expression is not possible, or (if you really treat this as a game) a problem about a winning strategy.
    $endgroup$
    – hardmath
    2 days ago











  • $begingroup$
    You're right, is not a question... but I'm interested in any interesting property somebody may find.
    $endgroup$
    – Cristian Baeza
    2 days ago















0












$begingroup$


I came up with this game yesterday, intended for first year college students in a very elementary math course, here it goes:



Suppose we have the numbers 1 2=3. If we place the $+$ sign between 1 and 2 we get 1+2=3, which is correct. Suppose now we have 1 2 3=4, I can make -1+2+3=4, which is also correct. I can also make, for 5, 6 and 7



$-1cdot2+3+4=5$



$1-2+3cdot4-5=6$



$1+2-3-4+5+6=7$



So the challenge is, to reach the most natural numbers from $$1quad2quad3quad4quadldotsquad (n-1)=n$$ by using addition subtraction, product and division in between the numbers without rearranging them.



At first this game seemed interesting, and eventually begin to wonder if this was always possible, and for instance, noticed (though not formally proved) that for the numbers $n=3+4k$ it is always possible. Feel free to post any interesting property you find.



Thanks










share|cite|improve this question









$endgroup$



put on hold as too broad by hardmath, Cesareo, Shailesh, Parcly Taxel, dantopa 2 days ago


Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.













  • 3




    $begingroup$
    "Feel free to post any interesting property you find" is not a question. If you review How to Ask, you'll see that Math.SE seeks Q&A content that is less chatty and more definitive than many forums collect. For example you might ask what the smallest $ngt 3$ is for which the expression is not possible, or (if you really treat this as a game) a problem about a winning strategy.
    $endgroup$
    – hardmath
    2 days ago











  • $begingroup$
    You're right, is not a question... but I'm interested in any interesting property somebody may find.
    $endgroup$
    – Cristian Baeza
    2 days ago













0












0








0


2



$begingroup$


I came up with this game yesterday, intended for first year college students in a very elementary math course, here it goes:



Suppose we have the numbers 1 2=3. If we place the $+$ sign between 1 and 2 we get 1+2=3, which is correct. Suppose now we have 1 2 3=4, I can make -1+2+3=4, which is also correct. I can also make, for 5, 6 and 7



$-1cdot2+3+4=5$



$1-2+3cdot4-5=6$



$1+2-3-4+5+6=7$



So the challenge is, to reach the most natural numbers from $$1quad2quad3quad4quadldotsquad (n-1)=n$$ by using addition subtraction, product and division in between the numbers without rearranging them.



At first this game seemed interesting, and eventually begin to wonder if this was always possible, and for instance, noticed (though not formally proved) that for the numbers $n=3+4k$ it is always possible. Feel free to post any interesting property you find.



Thanks










share|cite|improve this question









$endgroup$




I came up with this game yesterday, intended for first year college students in a very elementary math course, here it goes:



Suppose we have the numbers 1 2=3. If we place the $+$ sign between 1 and 2 we get 1+2=3, which is correct. Suppose now we have 1 2 3=4, I can make -1+2+3=4, which is also correct. I can also make, for 5, 6 and 7



$-1cdot2+3+4=5$



$1-2+3cdot4-5=6$



$1+2-3-4+5+6=7$



So the challenge is, to reach the most natural numbers from $$1quad2quad3quad4quadldotsquad (n-1)=n$$ by using addition subtraction, product and division in between the numbers without rearranging them.



At first this game seemed interesting, and eventually begin to wonder if this was always possible, and for instance, noticed (though not formally proved) that for the numbers $n=3+4k$ it is always possible. Feel free to post any interesting property you find.



Thanks







number-theory arithmetic






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 2 days ago









Cristian BaezaCristian Baeza

423213




423213




put on hold as too broad by hardmath, Cesareo, Shailesh, Parcly Taxel, dantopa 2 days ago


Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.









put on hold as too broad by hardmath, Cesareo, Shailesh, Parcly Taxel, dantopa 2 days ago


Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.









  • 3




    $begingroup$
    "Feel free to post any interesting property you find" is not a question. If you review How to Ask, you'll see that Math.SE seeks Q&A content that is less chatty and more definitive than many forums collect. For example you might ask what the smallest $ngt 3$ is for which the expression is not possible, or (if you really treat this as a game) a problem about a winning strategy.
    $endgroup$
    – hardmath
    2 days ago











  • $begingroup$
    You're right, is not a question... but I'm interested in any interesting property somebody may find.
    $endgroup$
    – Cristian Baeza
    2 days ago












  • 3




    $begingroup$
    "Feel free to post any interesting property you find" is not a question. If you review How to Ask, you'll see that Math.SE seeks Q&A content that is less chatty and more definitive than many forums collect. For example you might ask what the smallest $ngt 3$ is for which the expression is not possible, or (if you really treat this as a game) a problem about a winning strategy.
    $endgroup$
    – hardmath
    2 days ago











  • $begingroup$
    You're right, is not a question... but I'm interested in any interesting property somebody may find.
    $endgroup$
    – Cristian Baeza
    2 days ago







3




3




$begingroup$
"Feel free to post any interesting property you find" is not a question. If you review How to Ask, you'll see that Math.SE seeks Q&A content that is less chatty and more definitive than many forums collect. For example you might ask what the smallest $ngt 3$ is for which the expression is not possible, or (if you really treat this as a game) a problem about a winning strategy.
$endgroup$
– hardmath
2 days ago





$begingroup$
"Feel free to post any interesting property you find" is not a question. If you review How to Ask, you'll see that Math.SE seeks Q&A content that is less chatty and more definitive than many forums collect. For example you might ask what the smallest $ngt 3$ is for which the expression is not possible, or (if you really treat this as a game) a problem about a winning strategy.
$endgroup$
– hardmath
2 days ago













$begingroup$
You're right, is not a question... but I'm interested in any interesting property somebody may find.
$endgroup$
– Cristian Baeza
2 days ago




$begingroup$
You're right, is not a question... but I'm interested in any interesting property somebody may find.
$endgroup$
– Cristian Baeza
2 days ago










1 Answer
1






active

oldest

votes


















0












$begingroup$

Seems like there are many ways to do this. Thought of removing $*$ but then parity/modulo 2 problem prevents certain cases from working. Below is one possibility (middle rows are zeroes):
$4k+1$:
$$
beginalign
&-1*2+3\
&4-5-6+7,8-9-10+11,dots,+(4k-4)-(4k-3)-(4k-2)+(4k-1)\
&+(4k)
endalign
$$



$4k+2$:
$$
beginalign
&1*2 +3 -4\
&5-6-7+8,9-10-11+12,dots,+(4k-3)-(4k-2)-(4k-1)+(4k)\
&+(4k+1)
endalign
$$



$4k+3$:
$$
beginalign
&1\
&2-3-4+5,6-7-8+9,dots,+(4k-2)-(4k-1)-(4k)+(4k+1)\
&+(4k+2)
endalign
$$



$4k+4$:
$$
beginalign
&-1+2\
&3-4-5+6,7-8-9+10,dots,(4k-1)-(4k)-(4k+1)+(4k+2)\
&+(4k+3)
endalign
$$






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Unfortunately the rules of the "game" are not clear. In particular with a mixture of operations the role of parentheses, not mention in your Answer (or in the Question), becomes paramount.
    $endgroup$
    – hardmath
    2 days ago

















1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









0












$begingroup$

Seems like there are many ways to do this. Thought of removing $*$ but then parity/modulo 2 problem prevents certain cases from working. Below is one possibility (middle rows are zeroes):
$4k+1$:
$$
beginalign
&-1*2+3\
&4-5-6+7,8-9-10+11,dots,+(4k-4)-(4k-3)-(4k-2)+(4k-1)\
&+(4k)
endalign
$$



$4k+2$:
$$
beginalign
&1*2 +3 -4\
&5-6-7+8,9-10-11+12,dots,+(4k-3)-(4k-2)-(4k-1)+(4k)\
&+(4k+1)
endalign
$$



$4k+3$:
$$
beginalign
&1\
&2-3-4+5,6-7-8+9,dots,+(4k-2)-(4k-1)-(4k)+(4k+1)\
&+(4k+2)
endalign
$$



$4k+4$:
$$
beginalign
&-1+2\
&3-4-5+6,7-8-9+10,dots,(4k-1)-(4k)-(4k+1)+(4k+2)\
&+(4k+3)
endalign
$$






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Unfortunately the rules of the "game" are not clear. In particular with a mixture of operations the role of parentheses, not mention in your Answer (or in the Question), becomes paramount.
    $endgroup$
    – hardmath
    2 days ago















0












$begingroup$

Seems like there are many ways to do this. Thought of removing $*$ but then parity/modulo 2 problem prevents certain cases from working. Below is one possibility (middle rows are zeroes):
$4k+1$:
$$
beginalign
&-1*2+3\
&4-5-6+7,8-9-10+11,dots,+(4k-4)-(4k-3)-(4k-2)+(4k-1)\
&+(4k)
endalign
$$



$4k+2$:
$$
beginalign
&1*2 +3 -4\
&5-6-7+8,9-10-11+12,dots,+(4k-3)-(4k-2)-(4k-1)+(4k)\
&+(4k+1)
endalign
$$



$4k+3$:
$$
beginalign
&1\
&2-3-4+5,6-7-8+9,dots,+(4k-2)-(4k-1)-(4k)+(4k+1)\
&+(4k+2)
endalign
$$



$4k+4$:
$$
beginalign
&-1+2\
&3-4-5+6,7-8-9+10,dots,(4k-1)-(4k)-(4k+1)+(4k+2)\
&+(4k+3)
endalign
$$






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Unfortunately the rules of the "game" are not clear. In particular with a mixture of operations the role of parentheses, not mention in your Answer (or in the Question), becomes paramount.
    $endgroup$
    – hardmath
    2 days ago













0












0








0





$begingroup$

Seems like there are many ways to do this. Thought of removing $*$ but then parity/modulo 2 problem prevents certain cases from working. Below is one possibility (middle rows are zeroes):
$4k+1$:
$$
beginalign
&-1*2+3\
&4-5-6+7,8-9-10+11,dots,+(4k-4)-(4k-3)-(4k-2)+(4k-1)\
&+(4k)
endalign
$$



$4k+2$:
$$
beginalign
&1*2 +3 -4\
&5-6-7+8,9-10-11+12,dots,+(4k-3)-(4k-2)-(4k-1)+(4k)\
&+(4k+1)
endalign
$$



$4k+3$:
$$
beginalign
&1\
&2-3-4+5,6-7-8+9,dots,+(4k-2)-(4k-1)-(4k)+(4k+1)\
&+(4k+2)
endalign
$$



$4k+4$:
$$
beginalign
&-1+2\
&3-4-5+6,7-8-9+10,dots,(4k-1)-(4k)-(4k+1)+(4k+2)\
&+(4k+3)
endalign
$$






share|cite|improve this answer









$endgroup$



Seems like there are many ways to do this. Thought of removing $*$ but then parity/modulo 2 problem prevents certain cases from working. Below is one possibility (middle rows are zeroes):
$4k+1$:
$$
beginalign
&-1*2+3\
&4-5-6+7,8-9-10+11,dots,+(4k-4)-(4k-3)-(4k-2)+(4k-1)\
&+(4k)
endalign
$$



$4k+2$:
$$
beginalign
&1*2 +3 -4\
&5-6-7+8,9-10-11+12,dots,+(4k-3)-(4k-2)-(4k-1)+(4k)\
&+(4k+1)
endalign
$$



$4k+3$:
$$
beginalign
&1\
&2-3-4+5,6-7-8+9,dots,+(4k-2)-(4k-1)-(4k)+(4k+1)\
&+(4k+2)
endalign
$$



$4k+4$:
$$
beginalign
&-1+2\
&3-4-5+6,7-8-9+10,dots,(4k-1)-(4k)-(4k+1)+(4k+2)\
&+(4k+3)
endalign
$$







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 2 days ago









Yong Hao NgYong Hao Ng

3,7191222




3,7191222











  • $begingroup$
    Unfortunately the rules of the "game" are not clear. In particular with a mixture of operations the role of parentheses, not mention in your Answer (or in the Question), becomes paramount.
    $endgroup$
    – hardmath
    2 days ago
















  • $begingroup$
    Unfortunately the rules of the "game" are not clear. In particular with a mixture of operations the role of parentheses, not mention in your Answer (or in the Question), becomes paramount.
    $endgroup$
    – hardmath
    2 days ago















$begingroup$
Unfortunately the rules of the "game" are not clear. In particular with a mixture of operations the role of parentheses, not mention in your Answer (or in the Question), becomes paramount.
$endgroup$
– hardmath
2 days ago




$begingroup$
Unfortunately the rules of the "game" are not clear. In particular with a mixture of operations the role of parentheses, not mention in your Answer (or in the Question), becomes paramount.
$endgroup$
– hardmath
2 days ago



Popular posts from this blog

Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

Boston (Lincolnshire) Stedsbyld | Berne yn Boston | NavigaasjemenuBoston Borough CouncilBoston, Lincolnshire