Java-Gaming.org Hi !
 Featured games (91) games approved by the League of Dukes Games in Showcase (755) Games in Android Showcase (229) games submitted by our members Games in WIP (842) games currently in development
 News: Read the Java Gaming Resources, or peek at the official Java tutorials
Pages: [1]
 ignore  |  Print
 Math problem  (Read 2107 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.
Opiop
 « Reply #1 - Posted 2014-03-05 15:28:22 »

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

JGO Knight

Medals: 53

 « 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

« JGO Spiffy Duke »

Medals: 40
Projects: 4
Exp: 7 years

 « 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

 DesertCoockie (36 views) 2018-05-13 18:23:11 nelsongames (82 views) 2018-04-24 18:15:36 nelsongames (74 views) 2018-04-24 18:14:32 ivj94 (755 views) 2018-03-24 14:47:39 ivj94 (85 views) 2018-03-24 14:46:31 ivj94 (626 views) 2018-03-24 14:43:53 Solater (101 views) 2018-03-17 05:04:08 nelsongames (182 views) 2018-03-05 17:56:34 Gornova (408 views) 2018-03-02 22:15:33 buddyBro (1068 views) 2018-02-28 16:59:18
 Java Gaming Resourcesby philfrei2017-12-05 19:38:37Java Gaming Resourcesby philfrei2017-12-05 19:37:39Java Gaming Resourcesby philfrei2017-12-05 19:36:10Java Gaming Resourcesby philfrei2017-12-05 19:33:10List of Learning Resourcesby elect2017-03-13 14:05:44List of Learning Resourcesby elect2017-03-13 14:04:45SF/X Librariesby philfrei2017-03-02 08:45:19SF/X Librariesby philfrei2017-03-02 08:44:05
 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