Similar Posts

XFX Speedster QICK319 Radeon RX 6750XT Or ASUS Dual Radeon RX6750 XT?

ByHEYLOL268

Hello, I was wondering which of the two you would recommend. Here are the links again: ASUS: https://www.amazon.de/ASUS-Grafikkarte-Raum-DisplayPort-DUAL-RX6750XT-O12G/dp/B09YJ222L6/ref=mp_s_a_1_1?crid=1ZG L5S81L00FF&keywords=asus+dual+radeon+rx+6750+xt&qid=1699652909&sprefix=asus+dual+radeon+rx6750+xt%2Caps%2C215&sr=8-1 XFX: https://www.amazon.de/XFX-Speedster-QICK319-Grafikkarte-RX-675XYJFDP/dp/B0B34M1YLW/ref=mp_s_a_1_2?crid=ZV 33X15X3T8J&keywords=XFX+radeon+rx+6750+xt&qid=1699652960&sprefix=xfx+radeon+rx+6750+xt%2Caps%2C113&sr=8-2 Lg

How do you calculate VAT? I always thought it was ÷ 1.2, but that's wrong and I only found out a few days ago.

ByWusstIchDasNein

How do you calculate this now If you want to add them then you do 1000 × 1.2 and no not 19% and live in AT so2 0% So I know how to add myself in, but how do you do it if you want to subtract it.

Subscribe
Notify of
6 Answers
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
aperfect10
aperfect10
11 months ago

Part b) requires a function which calculates the largest common divider (ggT) for two numbers, a and b. So a picture showing two numbers to another number:

Now we need an accurate mapping rule. To this end, we recall the mathematical definition of ggT:

For two natural numbers a and b, the ggT d is the largest number, so that d divides a and d splits b.

The amount of all the numbers that share a and b can be written down formally:

Now you have to mark that you have largest Element of this amount. To do this, you can use a specific function… After that you have your searched mapping rule.

For c): In order for the algorithm to be correct, Alg(a,b) must correspond to ggT(a,b) for all natural a and b. So the sentence is:

0
WitchHunter0815
WitchHunter0815
11 months ago

Here, as an example, the partial quantity method:

int Teilermengen_ggT(int a, int b)
{
    int retval = 1;
    for (int i = 2; i <= a && i <= b; i++)
    {
        if (a % i == 0 && b % i == 0)
        {
            retval = i;
        }
    }
    return retval;
}
0
Francisco1234
Author
Francisco1234
11 months ago
Reply to  WitchHunter0815

The problem I don’t have to prove with programming language but by pure mathematics. In the lecture we were presented only evidence and something.

0
WitchHunter0815
WitchHunter0815
11 months ago
Reply to  Francisco1234

Well, the subset process is quite simple and simple:
Parts each of the two numbers by all numbers with 1 starting incl. self without remainder. Now find the largest number in both quantities.

0
Francisco1234
Author
Francisco1234
11 months ago

Yes, I found it on the Internet, but why it was not explained in the VL is the problem

0
Tannibi
Tannibi
11 months ago

At b you best take the Euclidean algorithm,
this saves the prime factor decomposition.

At c, I don’t know how it is meant.
A correct solution would be “The algorithm Alg(a, b)
calculates the ggT of a and b”, but this is probably not meant.

0