Java-Gaming.org
 Featured games (81) games approved by the League of Dukes Games in Showcase (497) Games in Android Showcase (114) games submitted by our members Games in WIP (563) games currently in development
 News: Read the Java Gaming Resources, or peek at the official Java tutorials
Pages: [1]
 ignore  |  Print
 Math problem  (Read 564 times) 0 Members and 1 Guest are viewing this topic.
Doubstract
 « Posted 2014-03-05 15:27:05 »

I cant solve this:

37x + 8 = z
43y + 11 = z
z < 1000
x,y - natural numbers

x = 21
y = 18
But, i need to prove it.
opiop65

JGO Kernel

Medals: 154
Projects: 7
Exp: 3 years

JumpButton Studios

 « Reply #1 - Posted 2014-03-05 15:28:22 »

Can you not prove it by just solving it and showing your work...?

quew8

JGO Coder

Medals: 29

 « Reply #2 - Posted 2014-03-05 22:03:05 »

I'm pretty sure that isn't possible to solve. There are three unknowns and only two sets of data. What is the context? Are you sure there isn't any more information?

Edit: Sorry, I didn't realize x and y were natural numbers. Read it but didn't take it in. @The Lion King has got it.
The Lion King
 « Reply #3 - Posted 2014-03-05 22:54:05 »

Set them equal to each other and it becomes the line :

Y = (37/43)x - 3/43

Now the answer has to be an int so the remainder of 37/43 x , must be 3/43

In other words 37/43x mod 1 must be 3/43. and x must also be a positive integer. You can probably stop here but ill continue if needed.

Every time x goes up one, the numerator of 37/43 x mod 1 drops by 3, and it loops around itself (Ex. if x = 1 , the numerator is 4 then if x = 2 the numerator is 41). You can prove this using induction, I wont bother.

every 7 iterations of x makes the numerator of the remainder move up by 1. If x = 1, makes the remainder numerator 37 then x=7 makes the remainder's numerator 1 according the all the logic I mentioned before.

So lets start at x = 7, the remainders numerator is now 1.
I mentioned before that 7 iterations adds 1 to the numerator, so x = 14 makes the numerator of the remainder 2.
x = 21 makes the numerator 3.

So now plug in 21 to get Y, then verify that both equations equate to a z that is less than 1000.

I hope that was clear :/ kind of difficult to explain feel free to ask questions

"You have to want it more than you want to breath, then you will be successful"
pjt33
 « Reply #4 - Posted 2014-03-05 23:31:54 »

You have z = 8 (mod 37) and z = 11 (mod 43). Apply the Chinese remainder theorem to find z mod 37*43.
Pages: [1]
 ignore  |  Print

You cannot reply to this message, because it is very, very old.

 Add your game by posting it in the WIP section, or publish it in Showcase. The first screenshot will be displayed as a thumbnail.
 BurntPizza (8 views) 2014-09-21 01:30:30 BurntPizza (9 views) 2014-09-21 00:34:41 moogie (10 views) 2014-09-21 00:26:15 UprightPath (23 views) 2014-09-20 20:14:06 BurntPizza (27 views) 2014-09-19 03:14:18 Dwinin (40 views) 2014-09-12 09:08:26 Norakomi (70 views) 2014-09-10 13:57:51 TehJavaDev (96 views) 2014-09-10 06:39:09 Tekkerue (49 views) 2014-09-09 02:24:56 mitcheeb (70 views) 2014-09-08 06:06:29
 BurntPizza 37x Riven 18x Rayvolution 18x basil_ 16x ags1 16x princec 16x KevinWorkman 15x LiquidNitrogen 12x deathpat 11x kevglass 11x nsigma 11x theagentd 11x HeroesGraveDev 8x Gibbo3771 6x cylab 6x EgonOlsen 6x
 List of Learning Resources2014-08-16 10:40:00List of Learning Resources2014-08-05 19:33:27Resources for WIP games2014-08-01 16:20:17Resources for WIP games2014-08-01 16:19:50List of Learning Resources2014-07-31 16:29:50List of Learning Resources2014-07-31 16:26:06List of Learning Resources2014-07-31 11:54:12HotSpot Optionsby dleskov2014-07-08 01:59:08
 java-gaming.org is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑gaming.org